Lower bounds for uniform machine scheduling using decision diagrams

DOI10.1007/978-3-030-19212-9_38MaRDI QIDQ2327285zbMATH OpenOpenAlexFDO

Authors Pim van den Bogaerdt, Mathijs M. de Weerdt

Publication date 14 October 2019

Full work available at URL http://resolver.tudelft.nl/uuid:0a091516-e7c2-4595-9ec5-2436ff84aa6b

zbMATH Keywords

decision diagramslower boundsmulti-machine schedulinguniform machines

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Multi-machine scheduling lower bounds using decision diagrams
• \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
• Decision diagrams for solving a job scheduling problem under precedence constraints
• Lower bounds for parallel machine scheduling problems

Cited in

(3)

• Single-machine scheduling with release times, deadlines, setup times, and rejection
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Multi-machine scheduling lower bounds using decision diagrams

This page was built for publication: Lower bounds for uniform machine scheduling using decision diagrams

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