Complexity results for parallel machine problems with a single server

Autor(en): Brucker, P
Dhaenens-Flipo, C
Knust, S 
Kravchenko, SA
Werner, F
Stichwörter: complexity results; Engineering; Engineering, Manufacturing; Operations Research & Management Science; parallel machines; single server
Erscheinungsdatum: 2002
Herausgeber: SPRINGER
Journal: JOURNAL OF SCHEDULING
Volumen: 5
Ausgabe: 6
Startseite: 429
Seitenende: 457
Zusammenfassung: 
Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at a time. In this paper we continue studying the complexity aspects of server problems begun in Hall et al. (Discrete Appl Math. 2000; 102:223) and Kravchenko and Wemer (Math. Comput. Model. 1997; 26:1). New complexity results are derived for special cases. Copyright (C) 2002 John Wiley Sons, Ltd.
Beschreibung: 
Workshop on Scheduling in Computer and Manufacturing Systems, DAGSTUHL CASTLE, GERMANY, OCT 24-29, 1999
ISSN: 10946136
DOI: 10.1002/jos.120

Show full item record

Page view(s)

7
Last Week
2
Last month
0
checked on Apr 20, 2024

Google ScholarTM

Check

Altmetric