Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
We consider the problem of scheduling n jobs on a single machine. Each job has a release date, when it becomes available for processing, and, after completing its processing, requires an additional delivery time. Feasible schedules are further restricted by job precedence constraints, and the objective is to minimize the time by which all jobs are delivered. In the notation of Graham et al. , this problem is noted 1∣r j, prec∣Lmax. We develop a polynomial time approximation scheme whose running time depends only linearly on the input size. This linear complexity bound gives a substantial improvement of the best previously known polynomial bound .
KeywordsRelease Date Delivery Time Precedence Constraint Precedence Relation Feasible Schedule
Unable to display preview. Download preview PDF.
- 1.M. R. Garey and D. S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979.Google Scholar
- 3.L. A. Hall and D. B. Shmoys. Approximation algorithms for constrained schedulingproblems. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS 1989), pages 134–139, 1989.Google Scholar
- 4.L. A. Hall and D. B. Shmoys. Near-optimal sequencingwith precedence constraints. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference (IPCO1990), pages 249–260. University of Waterloo Press, 1990.Google Scholar
- 6.J. R. Jackson. Schedulinga production line to minimize maximum tardiness. Technical Report Research Report 43, Management Science Research Project, UCLA, 1955.Google Scholar
- 8.J. K. Lenstra, A. H. G. R. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Operations Research, 1:343–362, 1977.Google Scholar