Multi-machine scheduling lower bounds using decision diagrams

Pim van den Bogaerdt, Mathijs de Weerdt

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
15 Downloads (Pure)

Abstract

We consider parallel multi-machine scheduling with due times, where a partition of jobs is given where jobs in the same partition have a common release time, possibly precedence constraints, and cannot overlap. A formulation of decision diagrams for this problem greatly improves upon a more natural extension of the state-of-the-art for single-machine scheduling, and can provide decent lower bounds, outperforming existing solvers given the same short runtime limit, for problem instances with large time scales and tight due times.

Original languageEnglish
Pages (from-to)616-621
Number of pages6
JournalOperations Research Letters
Volume46
Issue number6
DOIs
Publication statusPublished - 2018

Keywords

  • Decision diagrams
  • Lower bounds
  • Multi-machine scheduling

Fingerprint Dive into the research topics of 'Multi-machine scheduling lower bounds using decision diagrams'. Together they form a unique fingerprint.

Cite this