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

Johann L. Hurink, Sigrid Knust

Research output: Contribution to journalArticleAcademicpeer-review

50 Citations (Scopus)


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 languageUndefined
Pages (from-to)231-239
Number of pages9
JournalOperations research letters
Issue number5
Publication statusPublished - Dec 2001


  • METIS-203189
  • IR-63578
  • EWI-7582
  • MSC-90B35

Cite this