Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 16 (2) , 288-300
- https://doi.org/10.1137/s0895480199363908
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Better Approximation Guarantees for Job-Shop SchedulingSIAM Journal on Discrete Mathematics, 2001
- Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing SchedulesCombinatorica, 1999
- Makespan minimization in preemptive two machine job shopsComputing, 1998
- Short Shop SchedulesOperations Research, 1997
- Coordination Complexity of Parallel Price-Directive DecompositionMathematics of Operations Research, 1996
- On some geometric methods in scheduling theory: a surveyDiscrete Applied Mathematics, 1994
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- Improved Approximation Algorithms for Shop Scheduling ProblemsSIAM Journal on Computing, 1994
- Analysis of a linear programming heuristic for scheduling unrelated parallel machinesDiscrete Applied Mathematics, 1985