Job shop scheduling with unit processing times
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Value-maximizing deadline scheduling and its application to animation rendering
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
SIAM Journal on Discrete Mathematics
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
An optimal method for the preemptive job shop scheduling problem
Computers and Operations Research
Approximations for the Two-Machine Cross-Docking Flow Shop Problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper we present a linear time approximation scheme for the job shop scheduling problem with a fixed number of machines and fixed number of operations per job. This improves on the previously best $2+\epsilon$, $\epsilon 0$, approximation algorithm for the problem by Shmoys, Stein, and Wein [SIAM J. Comput., 23 (1994), pp. 617--632]. Our approximation scheme is very general and it can be extended to the case of job shop scheduling problems with release and delivery times, multistage job shops, dag job shops, and preemptive variants of most of these problems.