Heuristics for Hybrid Flow Shops with Controllable Processing Times
Preprint series: 98-29, Preprints
The paper is published: Computers & Operations Research, Vol. 29, No. 10, 2002, 1417 - 1439.
Abstract: 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.
Keywords: Scheduling, Hybrid Flow Shop, Controllable Processing Times, Assignable Due Dates, Heuristics
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.