Complexity results for flow shop problems with synchronous movement

Autor(en): Waldherr, Stefan 
Knust, Sigrid 
Stichwörter: Business & Economics; Complexity; Dominating machines; Flow shop; Management; ONE MACHINE; Operations Research & Management Science; Synchronous movement; TRANSFERS
Erscheinungsdatum: 2015
Herausgeber: ELSEVIER
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 242
Ausgabe: 1
Startseite: 34
Seitenende: 44
Zusammenfassung: 
In this paper we present complexity results for flow shop problems with synchronous movement which are a variant of a non-preemptive permutation flow shop. Jobs have to be moved from one machine to the next by an unpaced synchronous transportation system, which implies that the processing is organized in synchronized cycles. This means that in each cycle the current jobs start at the same time on the corresponding machines and after processing have to wait until the last job is finished. Afterwards, all jobs are moved to the next machine simultaneously. Besides the general situation we also investigate special cases involving machine dominance which means that the processing times of all jobs on a dominating machine are at least as large as the processing times of all jobs on the other machines. Especially, we study flow shops with synchronous movement for a small number of dominating machines (one or two) and different objective functions. (C) 2014 Elsevier B.V. All rights reserved.
ISSN: 03772217
DOI: 10.1016/j.ejor.2014.09.053

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on Feb 23, 2024

Google ScholarTM

Check

Altmetric