Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-23T00:57:09.022Z Has data issue: false hasContentIssue false
  • English
  • Français

Single Machine Preemptive Schedulingto Minimize the Weighted Number of Late Jobs withDeadlines and Nested Release/Due Date Intervals

Published online by Cambridge University Press:  15 August 2002

Valery S. Gordon ,
F. Werner  and
O. A. Yanushkevich
Valery S. Gordon
Affiliation:
Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Minsk, Belarus.
F. Werner
Affiliation:
Otto-von-Guericke University of Magdeburg, Germany.
O. A. Yanushkevich
Affiliation:
Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Minsk, Belarus.
Get access

Abstract

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they have at most one common point or one covers the other). Necessary and sufficient conditions for the completion of all jobs in time are considered, and an O(nlogn) algorithm (where n is the number of jobs) is proposed for solving the problem of minimizing the weighted number of late jobs in case of oppositely ordered processing times and weights.

Keywords

Single machine schedulingrelease and due datesdeadlinesnumber of late jobs.
Type
Research Article
Information
RAIRO - Operations Research , Volume 35 , Issue 1 , January 2001 , pp. 71 - 83
Copyright
© EDP Sciences, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Gordon, V., Potapneva, E. and Werner, F., Single machine scheduling with deadlines, release and due dates. Optimization 42 (1997) 219-244. CrossRef
V.S. Gordon and V.S. Tanaev, Single machine deterministic scheduling with step functions of penalties, in: Computers in Engineering. Minsk (1971) 3-8 (in Russian).
Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 (1979) 287-326. CrossRef
R.M. Karp, Reducibility among combinatorial problems, edited by R.E. Miller and J.W. Thatcher, Complexity of Computer Computations. Plenum Press, New York (1972) 85-103.
Kise, H., Ibaraki, T. and Mine, H., A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26 (1978) 121-126. CrossRef
Lawler, E.L., Sequencing to minimize the weighted number of tardy jobs. RAIRO Oper. Res. 10 (1976) 27-33.
E.L. Lawler, Scheduling a single machine to minimize the number of late jobs. Preprint. Computer Science Division, University of California, Berkeley (1982).
Lawler, E.L., A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26 (1990) 125-133. CrossRef
Lawler, E.L., Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ``tower of sets'' property. Math. Comput. Modelling 20 (1994) 91-106. CrossRef
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, edited by S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, Logistics of Production and Inventory. North-Holland, Handbooks Oper. Res. Management Sci. 4 (1993) 445-522.
Lawler, E.L. and Moore, J.M., A functional equation and its application to resource allocation and sequencing problems. Management Sci. 16 (1969) 77-84. CrossRef
Lenstra, J.K. and Rinnooy Kan, A.H.G., Complexity results for scheduling chains on a single machine. European J. Oper. Res. 4 (1982) 270-275. CrossRef
Lenstra, J.K., Rinnooy Kan, A.H.G. and Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977) 343-362. CrossRef
Monma, C.L., Linear-time algorithms for scheduling on parallel processors. Oper. Res. 30 (1980) 116-124. CrossRef
Moore, J.M., An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15 (1968) 102-109. CrossRef
J.B. Sidney, An extension of Moore's due date algorithm, edited by S.E. Elmaghraby, Symposium on the Theory of Scheduling and its Applications. Springer, Berlin, Lecture Notes in Econom. and Math. Systems 86 (1973) 393-398.
V.S. Tanaev and V.S. Gordon, On scheduling to minimize the weighted number of late jobs. Vestsi Akad. Navuk Belarus Ser. Fizi.-Mat. Navuk 6 (1983) 3-9 (in Russian).
V.S. Tanaev, V.S. Gordon and Y.M. Shafransky, Scheduling Theory. Single-Stage Systems. Kluwer Academic, Dordrecht (1994).