Hardness of Approximating Flow and Job Shop Scheduling Problems
From MaRDI portal
Publication:5395665
DOI10.1145/2027216.2027218zbMath1281.68127OpenAlexW2109864780MaRDI QIDQ5395665
Monaldo Mastrolilli, Ola Svensson
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2027216.2027218
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (10)
A study on several combination problems of classic shop scheduling and shortest path ⋮ Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ Shop scheduling in manufacturing environments: a review ⋮ A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints ⋮ Scheduling Problems over Network of Machines ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ Scheduling problems over a network of machines ⋮ Scheduling MapReduce jobs on identical and unrelated processors ⋮ Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates
This page was built for publication: Hardness of Approximating Flow and Job Shop Scheduling Problems
