A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- 644 Downloads
The scheduling problem 1|pmtn, r j |Σw j U j calls forn jobs with arbitrary release dates and due dates to be preemptively scheduled for processing by a single machine, with the objective of minimizing the sum of the weights of the late jobs. A dynamic programming algorithm for this problem is described. Time and space bounds for the algorithm are, respectively,O(nk2W2) andO(k2W), wherek is the number of distinct release dates andW is the sum of the integer job weights. Thus, for the problem 1|pmtn, r j |ΣU j , in which the objective is simply to minimize the number of late jobs, the pseudopolynomial time bound becomes polynomial, i.e.O(n3k2).
KeywordsSchedule Problem Dynamic Programming Release Date Single Machine Programming Algorithm
Unable to display preview. Download preview PDF.
- K.R. Baker, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize cost subject to release dates and precedence constraints, Oper. Res. 31(1983)381–386.Google Scholar
- R. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discr. Math. 2(1979)75–90.Google Scholar
- H. Kise, T. Ibaraki and H. Mine, A solvable case of the one-machine scheduling problem with ready and due dates, Oper. Res. 26(1978)121–126.Google Scholar
- E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Manag. Sci. 16(1969)77–84.Google Scholar
- E.L. Lawler, Sequencing to minimize the weighted number of tardy jobs, Rev. Française Automatique, Informatique, Recherche Operationnel, 10 supp. (1976) 27–33.Google Scholar
- E.L. Lawler, Three variations of Moore's algorithm for minimizing the number of late jobs, in preparation.Google Scholar
- J.M. Moore, Sequencingn jobs on one machine to minimize the number of tardy jobs, Manag. Sci. 15(1968)102–109.Google Scholar