A survey of scheduling problems with late work criteria

Omega

Volumn 39, Issue 2, 2011, Pages 120-129

  Sterna, Malgorzata ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Dedicated machines; Late work; Parallel machines; Scheduling; Single machine

Indexed keywords

EID: 77955842650     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2010.06.006     Document Type: Review

References (71)

1. Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J. Handbook on scheduling. From theory to applications 2007, Springer, Berlin-Heidelberg-New York.
2. Brucker P. Scheduling algorithms 2007, Springer, Berlin-Heidelberg-New York.
3. Pinedo M. Scheduling: theory, algorithms and systems 2008, Springer, New York.
4. Chen B, Potts CN, Woeginger GJ. A review of machine scheduling. Handbook of combinatorial optimization 1998, 21-169. Kluwer Academic Publishers, Boston. D.-Z. Du, P.M. Pardalos (Eds.).
5. Leung JY-T Minimizing total weighted error for imprecise computation tasks and related problems. Handbook of scheduling: algorithms, models, and performance analysis 2004, 34.1-34.16. CRC Press, Boca Raton. L. JY-T (Ed.).
6. Blazewicz J. Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques 1984, 3(6):415-420.
7. Potts CN, Van Wassenhove LN. Single machine scheduling to minimize total late work. Operations Research 1991, 40(3):586-595.
8. Hochbaum DS, Shamir R. Minimizing the number of tardy job units under release time constraints. Discrete Applied Mathematics 1990, 28(1):45-57.
9. Blazewicz J, Pesch E, Sterna M, Werner F. Total late work criteria for shop scheduling problems. Operations Research Proceedings 1999 2000, 354-359. Springer, Berlin. K. Inderfurth, G. Schwoediauer, W. Domschke, F. Juhnke, P. Kleinschmidt, G. Waescher (Eds.).
10. Jozefowska J, Jurisch B, Kubiak W. Scheduling shops to minimize the weighted number of late jobs. Operation Research Letters 1994, 16(5):277-283.
11. Blazewicz J, Pesch E, Sterna M, Werner F. Open shop scheduling problems with late work criteria. Discrete Applied Mathematics 2004, 134(1):1-24.
12. Blazewicz J, Pesch E, Sterna M, Werner F. The two-machine flow-shop problem with weighted late work criterion and common due date. European Journal of Operational Research 2005, 165(2):408-415.
13. Blazewicz J, Pesch E, Sterna M, Werner F. A note on two-machine job shop with weighted late work criterion. Journal of Scheduling 2007, 10(2):87-95.
14. Sterna M. Problems and algorithms in non-classical shop scheduling 2000, Scientific Publishers of the Polish Academy of Sciences, Poznan.
15. Kolliopoulos SG, Steiner G. Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theoretical Computer Science 2006, 335(3):261-273.
16. Lin K-J, Natarajan S, Liu JWS, Krauskopf T. Concord: a system of imprecise computations. In: Proceedings of IEEE computer software and applications conference,Tokyo; 1987. pp. 75-81.
17. Liu JWS, Lin K-J, Shih SW, Yu AC, Chung J-Y, Zhao W. Algorithms for scheduling imprecise computation. IEEE Computers 1991, 24:58-68.
18. Gribkovskaia IV, Kovalev S, Werner F Batching for work and rework processes on dedicated facilities to minimize the makespan. Omega 2010, 38(6):522-527.
19. Leung JY-T, Yu VKM, Wei W-D. Minimizing the weighted number of tardy task units. Discrete Applied Mathematics 1994, 51(3):307-316.
20. Kethley RB, Alidaee B. Single machine scheduling to minimize total late work: a comparison of scheduling rules and search algorithms. Computers and Industrial Engineering 2002, 43(3):509-528.
21. Ren J, Zhang Y, Sun G. The NP-hardness of minimizing the total late work on an unbounded batch machine. Asia-Pacific Journal of Operational Research 2009, 26(3):351-363.
22. Sterna M. Late work scheduling in shop systems. Dissertations 405 2006, Publishing House of Poznan University of Technology, Poznan.
23. Almiñana M, Escudero LF, Landete M, Monge JF, Rabasa A, Sánchez-Soriano J. WISCHE: A DSS for water irrigation scheduling. Omega 2010, 38(6):492-500.
24. Jackson JR. Scheduling a production line to minimize maximum tardiness. Research Report 43. Management Science Research Project. Los Angeles: University of California; 1955.
25. Hochbaum DS, Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research 1991, 39(4):648-653.
26. Lin BMT, Hsu SW. Minimizing total late work on a single machine with release and due dates. In: SIAM conference on computational science and engineering, Orlando; 2005.
27. Potts CN, Van Wassenhove LN. Approximation algorithms for scheduling a single machine to minimize total late work. Operations Research Letters 1991, 11(5):261-266.
28. Woeginger GJ. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?. INFORMS Journal on Computing 2000, 12(1):57-74.
29. Hariri AMA, Potts CN, Van Wassenhove LN. Single machine scheduling to minimize total late work. ORSA Journal on Computing 1995, 7(2):232-242.
30. Yu K-M. Approximation algorithms for minimizing the number of tardy units in real-time system. PhD thesis. Dallas: The University of Texas at Dallas; 1991.
31. Shih W-K, Liu JWS, Chung J-Y. Algorithms for scheduling imprecise computations with timing constraints. SIAM Journal of Computing 1991, 20(3):537-552.
32. Kovalyov MY, Potts CN, Van Wassenhove LN. A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research 1994, 19(1):86-93.
33. Lawler EL. Combinatorial optimization: networks and matroids 1976, Holt, Rinhart and Winston, New York.
34. Baptiste P. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling 1999, 2(6):245-252.
35. Lenstra JK, Rinnoy Kan AHG Complexity results for scheduling chains on a single machine. European Journal of Operational Research 1980, 4(4):270-275.
36. Zhang Y, Wang L. The NP-completeness of a new batch scheduling problem. Journal of Systems, Science and Mathematical Sciences 2005, 25(1):13-17.
37. Brucker P, Gladky PA, Hoogeven H, Kovalyov MY, Potts CN, Tautenhahn T, Van de Velde S. Scheduling a batching machine. Journal of Scheduling 1998, 1(1):31-54.
38. Blazewicz J, Finke G. Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters 1987, 24(4):259-263.
39. McNaughton R. Scheduling with deadlines and loss functions. Management Science 1959, 12:1-12.
40. 3) algorithm for finding maximum flows in networks. Information Processing Letters 1978, 7(6):277-278.
41. Tardos E. A strongly polynomial minimum cost circulation algorithm. Combinatorica 1985, 5(3):247-255.
42. Chung JY, Shih WK, Liu JWS, Gilles DW. Scheduling imprecise computations to minimize total error. Microprocessing and Microprogramming 1989, 27:767-774.
43. Orlin JB. A faster strongly polynomial minimum cost flow algorithm. In: Proceedings of 20th ACM symposium of the theory of computing, Chicago; 1988. pp. 377-387.
44. Tarjan RE. Data structures and network algorithms 1983, Society for Industrial and Applied Mathematics, Philadelphia.
45. Federgruen A, Groenevelt H. Preemptive scheduling of uniform machines with release times and due dates. Management Science 1986, 32(3):341-349.
46. Gonzalez T, Sahni S. Preemptive scheduling of uniform processor systems. Journal of ACM 1978, 25(1):91-101.
47. Gusfield D, Martel C, Fernandez-Baca D. Fast algorithms for bipartite network flow. SIAM Journal on Computing 1987, 16(2):237-251.
48. Garey MR, Johnson DS. Computers and intractability 1979, W.H. Freeman and Co, San Francisco.
49. Brucker P, Knust S. Complexity results for scheduling problems. 2010. http://www.mathematik.uni-osnabrueck.de/research/OR/class/.
50. Baptiste P, Brucker P, Knust S, Timkovsky VG .Ten notes on equal-processing-time scheduling. At the frontiers of solvability in polynomial time. 4OR: A Quarterly Journal of Operations Research 2004, 2:111-127.
51. Gonzalez T, Sahni S. Open shop scheduling to minimize finish time. Journal of the ACM 1976, 23(4):665-679.
52. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954, 1:61-68.
53. Blazewicz J, Pesch E, Sterna M, Werner F. Flow shop scheduling with late work criterion-choosing the best solution strategy. Lecture Notes in Computer Science 2004, 3285:68-75.
54. Blazewicz J, Pesch E, Sterna M, Werner F. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Computers and Industrial Engineering 2005, 49(4):611-624.
55. Blazewicz J, Pesch E, Sterna M, Werner F. Metaheuristics for late work minimization in two-machine flow shop with common due date. Lecture Notes in Artificial Intelligence 2005, 3698:222-234.
56. Blazewicz J, Pesch E, Sterna M, Werner F. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Computers and Operations Research 2008, 35(2):574-599.
57. Jackson JR. An extension of Johnson's results on job shop scheduling. Naval Research Logistics Quarterly 1956, 3:201-203.
58. Lin BMT, Lin FC, Lee RCT Two-machine flowshop scheduling to minimize total late work. Engineering Optimization 2006, 38(4):501-509.
59. Sterna M. Dominance relations for two-machine flow-shop problem with late work criterion. Bulletin of the Polish Academy of Sciences 2007, 55(1):59-69.
60. Pesch E, Sterna M. Late work minimization in flow shop by a genetic algorithm. Computers and Industrial Engineering 2009, 57(4):1202-1209.
61. Dorndorf U, Pesch E. Evolution based learning in a job shop scheduling environment. Computers and Operations Research 1995, 22(1):25-40.
62. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993, 64(2):278-285.
63. Rad SF, Ruiz R, Boroojerdian N. New high performing heuristics for minimizing makespan in permutation flowshops. Omega 2009, 37(2):331-345.
64. Ronconi DP, Henriques LRS Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 2009, 37(2):272-281.
65. Sterna M. Late work minimization in a small flexible manufacturing system. Computers and Industrial Engineering 2007, 52(2):210-228.
66. Lee IS, Yoon SH. Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs. Omega 2010, 38(6):509-521.
67. Fagerholt K, Christiansen M, Hvattum LM, Johnsen TAV, Vabø TJ. A decision support methodology for strategic planning in maritime transportation. Omega 2010, 38(6):465-474.
68. Carlier J, Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 1994, 78(2):146-161.
69. Lee W-C, Wu C-C, Hsu P-H. A single-machine learning effect scheduling problem with release times. Omega 2010, 38(1-2):3-11.
70. Janiak A, Rudek R. A note on a makespan minimization problem with a multi-ability learning effect. Omega 2010, 38(3-4):213-217.
71. Yang S-J, Yang D-L. Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega 2010, 38(6):528-533.