Zurück zu den Preprints des Jahres 2006


Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria

by Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., Werner, F..

Series: 2006-26, Preprints

90B35 Scheduling theory, deterministic

This paper considers the problem of scheduling n jobs in a flexible flow shop scheduling environment with unrelated parallel machines. For each job, a release and due date are given and both sequence- and machine-dependent setup times are considered. The problem is to determine a schedule that minimizes a convex combination of makespan and the number of tardy jobs. A 0-1 mixed integer program is formulated, and various heuristic algorithms are developed. First, a number of constructive algorithms are discussed, and then a genetic algorithm is presented and tested on problems with up to 50 jobs and 20 stages.

Flexible Flow Shop Scheduling, Heuristics, Genetic Algorithms, Mathematical Programming

This paper was published in:
International Journal of Adv