Complete Complexity Classification of Short Shop Scheduling

DOI10.1007/978-3-642-03351-3_22zbMath1223.90025OpenAlexW2120440833MaRDI QIDQ3392957

Alexander V. Kononov, M. I. Sviridenko, Sergey Sevast'janov

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Three, four, five, six, or the complexity of scheduling with communication delays
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity of mixed shop scheduling problems: A survey
• An Algorithm for Solving the Job-Shop Problem
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Open Shop Scheduling to Minimize Finish Time
• Complexity of Scheduling under Precedence Constraints
• The edge chromatic number of a directed/mixed multigraph
• Short Shop Schedules
• Minimizing Makespan in No-Wait Job Shops

This page was built for publication: Complete Complexity Classification of Short Shop Scheduling