908 search results - page 43 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
105
click to vote
GECCO
2006
Springer
2006
Springer
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
15 years 5 months ago
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator-Non-Wrapping Order Crossover (NWOX)--is a variation of the well-...
116
Voted
RTAS
2008
IEEE
15 years 8 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
141
Voted
CP
2008
Springer
15 years 3 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
115
click to vote
EOR
2010
15 years 1 months ago
2010
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
118
click to vote
CP
2010
Springer
15 years 14 days ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...