Complexity results for flow-shop problems with a single server

Autor(en): Brucker, P
Knust, S 
Wang, GQ
Stichwörter: Business & Economics; COMMON SERVER; complexity results; flow-shop; MACHINES; Management; Operations Research & Management Science; SCHEDULING RESEARCH; SETUP TIMES; single server
Erscheinungsdatum: 2005
Herausgeber: ELSEVIER SCIENCE BV
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 165
Ausgabe: 2
Startseite: 398
Seitenende: 407
Zusammenfassung: 
Flow-shop problems with a single server are generalizations of classical flow-shop problems. Immediately before processing, each operation must be loaded onto the corresponding machine, which takes a certain setup time. These setup times are assumed to be separable from the processing times, i.e. a setup on a subsequent machine may be performed while the job is still processed on the preceding machine. All setups have to be done by a single server which can perform at most one setup at a time. New complexity results are derived for special cases. (c) 2004 Elsevier B.V. All rights reserved.
Beschreibung: 
8th International Workshop on Project Management and Scheduling, Univ Valencia, Valencia, SPAIN, APR 03-05, 2002
ISSN: 03772217
DOI: 10.1016/j.ejor.2004.04.010

Show full item record

Page view(s)

3
Last Week
0
Last month
1
checked on Feb 27, 2024

Google ScholarTM

Check

Altmetric