Multi-machine scheduling lower bounds using decision diagrams

DOI10.1016/J.ORL.2018.11.003MaRDI QIDQ2294251zbMATH OpenOpenAlexFDO

Authors Pim van den Bogaerdt, Mathijs M. de Weerdt

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)

Recommendations

• Lower bounds for uniform machine scheduling using decision diagrams
• Multiple-machine lower bounds for shop-scheduling problems
• Lower bounds for parallel machine scheduling problems
• scientific article; zbMATH DE number 4191384
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• A new lower bound approach for single-machine multicriteria scheduling
• A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
• Complexity of scheduling problems with multi-purpose machines
• scientific article; zbMATH DE number 1834660
• A lower bound for scheduling mechanisms

Cites work

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

Cited in

(5)

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

Describes a project that uses

Uses Software

• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294251)