Explicit Learning: an Effort towards Human Scheduling Algorithms

Details Explicit Learning: an Effort towards Human Scheduling Algorithms Explicit Learning: an Effort towards Human Scheduling Algorithms

2008-04-03

arxiv.org/abs/0804.0580v1

Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2003), pp 240-

Computer Science

Neural and Evolutionary Computing

Scientific paper

Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem.

Affiliated with

Also associated with

No associations

Rating

Explicit Learning: an Effort towards Human Scheduling Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Explicit Learning: an Effort towards Human Scheduling Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit Learning: an Effort towards Human Scheduling Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352852