Scheduling identical jobs with chain precedence constraints on two uniform machines

P. Brucker, Johann L. Hurink, W. Kubiak

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)

Abstract

The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time.
Original languageUndefined
Article number10.1007/s001860050021
Pages (from-to)211-219
Number of pages9
JournalMathematical methods of operations research
Volume49
Issue number2
DOIs
Publication statusPublished - Apr 1999

Keywords

  • IR-63599
  • EWI-7628

Cite this