A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 649-656

  Bornstein, Claudio Thomás ^a   Alcoforado, Luciane Ferreira ^a   MacUlan, Nelson ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Combinatorial optimization; Parallel machines scheduling problem; Preemptive scheduling

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPETITION; GRAPH THEORY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

COMBINATORIAL OPTIMIZATION; PARALLEL MACHINES; PARALLEL MACHINES SCHEDULING PROBLEM; PREEMPTIVE SCHEDULING;

JOB ANALYSIS;

EID: 13444280149     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.06.045     Document Type: Article

References (29)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows. 1993;Prentice Hall, Englewood Cliffs, NJ
2. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research. 38:1990;22-36
3. Brucker P. Scheduling Algorithms. 1998;Springer Verlag, Berlin
4. Cheng T.C.E., Gupta M.C. Survey of scheduling research involving due date determination decisions. European Journal of Operational Research. 38:1989;156-166
5. Cheng T.C.E., Sin C.C.S. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research. 47:1990;271-292
6. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison Wesley, Reading, MA
7. Dauzére Pérès S. Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research. 81:1995;134-142
8. Du, J., Leung, J.Y.T., Wong, C.S., 1989. Minimizing the number of late jobs with release time constraints. Technical Report, Computer Science Program, University of Texas, Dallas
9. Federgruen A., Groenevelt H. Preemptive scheduling of uniform machines by ordinary network flow techniques. Management Science. 32:1986;341-349
10. Guner E., Erol S., Tani K. One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs. International Journal of Production Economics. 55(2):1998;213-219
11. Gupta J.N.D., Hariri A.M.A., Potts C.N. Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs. Annals of Operations Research. 92:1999;107-123
12. Ho J.C., Chang Y.L. Minimizing the number of tardy jobs for. m parallel machines European Journal of Operational Research. 84:1995;343-355
13. Kahlbacher H.G., Cheng T.C.E. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Applied Mathematics. 47:1993;139-164
14. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York
15. Lam K., Xing W. New trends in parallel machine scheduling. International Journal of Operations and Production Management. 17(3):1997;326-338
16. Lawler, E.L., 1979. Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Report BW 105, Centre for Mathematics and Computer Science, Amsterdam
17. Lawler E.L. Recent results in the theory of machine scheduling. Bachem A., Grötschel M., Korte B. Mathematical Programming: The State of the Art - Bonn 1982. 1983;202-234 Springer, Berlin
18. Lawler E.L., Martel C.U. Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research. 37:1989;314-318
19. Lawler E.L., Moore J.M. A functional equation and its applications to resource allocation and sequencing problems. Management Science. 16:1969;77-84
20. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P. Handbooks in Operations Research and Management Science 4: Logistic of Production and Inventory. 1993;445-522 North-Holland
21. Monma C.L. Linear-time algorithms for scheduling on parallel processors. Operations Research. 30:1982;116-124
22. Moore J.M. An. n job, one machine sequencing algorithm for minimizing the number of late jobs Management Science. 15:1968;102-109
23. Morton T.E., Pentico D.W. Heuristic Scheduling Systems. 1993;John Wiley, New York
24. Peha J.M. Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time. Computers and Operations Research. 22(10):1995;1089-1100
25. Pinedo M. Scheduling - Theory, Algorithms and Systems. 1995;Prentice Hall, Englewood Cliffs, NJ
26. Rinnooy Kan A.H.G. Machine Scheduling Problems: Classification, Complexity and Computations. 1976;Martinus Nijhoff, The Hague
27. Sauer G.A., Pico F., Santiago A. Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed. Computers and Industrial Engineering. 33(1-2):1997;277-280
28. Sharary A.H., Zaguia N. Minimizing the number of tardy jobs in single-machine sequencing. Discrete Mathematics. 117(1-3):1993;215-223
29. Vairaktarakis G.L., Lee C.Y. The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs. IIE Transactions. 27(2):1995;250-256