Abstract
We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additionally 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.
Original language | Undefined |
---|---|
Pages (from-to) | 231-239 |
Number of pages | 9 |
Journal | Operations research letters |
Volume | 29 |
Issue number | 5 |
DOIs | |
Publication status | Published - Dec 2001 |
Keywords
- METIS-203189
- IR-63578
- EWI-7582
- MSC-90B35