Lower bounds for uniform machine scheduling using decision diagrams

DOI10.1007/978-3-030-19212-9_38OpenAlexW2945428775MaRDI QIDQ2327285

Pim van den Bogaerdt, Mathijs de Weerdt

Publication date: 14 October 2019

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

zbMATH Keywords

lower boundsuniform machinesmulti-machine schedulingdecision diagrams

Mathematics Subject Classification ID

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

Related Items

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