by Gupta, J.N.D., Krüger, K., Lauff, V., Sotskov, Y.N., Werner, F..
Series: 1998-29, Preprints
We consider a generalization of the permutation flow shop problem of scheduling n jobs in m machine centers
which more appropriately represents several production scheduling problems. Each center consists of parallel identical
machines, each job consists of ordered operations where the sequence in which the jobs pass through the machine centers is identical
for all jobs. The processing times may vary between a minimum and a maximum value dependent on the use of a resource. We consider a nonregular criterion
based on the due dates which are not a priori given. For this generalization, we propose a heuristic constructive algorithm based on job insertion techniques and
heuristic iterative algorithms.
Scheduling, Hybrid Flow Shop, Controllable Processing Times, Assignable Due Dates, Heuristics
This paper was published in:
Computers & Operations