Makespan minimization in job shops

DOI10.1145/301250.301351zbMath1345.90044OpenAlexW2031724616MaRDI QIDQ2819572

Roberto Solis-Oba, M. I. Sviridenko, Klaus Jansen

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301351

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ Inapproximability results for no-wait job shop scheduling. ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ An improved approximation algorithm for scheduling under arborescence precedence constraints

This page was built for publication: Makespan minimization in job shops