Multi-machine scheduling lower bounds using decision diagrams

DOI10.1016/j.orl.2018.11.003zbMath1476.90133OpenAlexW2899919328MaRDI QIDQ2294251

Mathijs de Weerdt, Pim van den Bogaerdt

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:5538437b-0c72-407d-b8e0-888855fa8bc5

zbMATH Keywords

lower boundsmulti-machine schedulingdecision diagrams

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming

Uses Software

• OR-Library

Cites Work

• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
• Lagrangian bounds from decision diagrams
• Lower bounds for parallel machine scheduling problems
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• List scheduling revisited
• Multi-machine scheduling lower bounds using decision diagrams
• Discrete Optimization with Decision Diagrams
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Multivalued Decision Diagrams for Sequencing Problems
• Scheduling

This page was built for publication: Multi-machine scheduling lower bounds using decision diagrams