List scheduling in a parallel machine environment with precedence constraints and setup times

Autor(en): Hurink, J
Knust, S 
Stichwörter: complexity; list scheduling; Operations Research & Management Science; parallel machines; scheduling; setup times
Erscheinungsdatum: 2001
Herausgeber: ELSEVIER SCIENCE BV
Journal: OPERATIONS RESEARCH LETTERS
Volumen: 29
Ausgabe: 5
Startseite: 231
Seitenende: 239
Zusammenfassung: 
We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additional precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling problems, in this environment a set of dominant schedules cannot be calculated efficiently with list scheduling techniques. (C) 2002 Elsevier Science B.V. All rights reserved.
ISSN: 01676377
DOI: 10.1016/S0167-6377(01)00104-3

Show full item record

Page view(s)

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

Google ScholarTM

Check

Altmetric