Applications of Modern Heuristic Search Methods to Continuous Flow-shop Scheduling Problems


Continuous ow-shop scheduling problems circumscribe an important class of sequenc-ing problems in the eld of production planning. The problem considered here is to nd a permutation of jobs to be processed sequentially on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of… (More)


1 Figure or Table