Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints

DOI10.1007/978-3-030-25005-8_30MaRDI QIDQ2301756zbMATH OpenOpenAlexFDO

Authors Fumito Miyake, Eiji Takimoto, Kohei Hatano

Publication date 25 February 2020

Full work available at URL http://hdl.handle.net/2324/4495596

zbMATH Keywords

combinatorial optimizationjob schedulingMDDprecedence constraints

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Decision diagrams for solving a job scheduling problem under precedence constraints
• Multivalued decision diagrams for sequencing problems
• Single Machine Scheduling with Series-Parallel Precedence Constraints
• Scheduling partially ordered jobs faster than \(2^{n }\)
• Scheduling partially ordered jobs faster than \(2^n\)

This page was built for publication: Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints

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