Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey

International Journal of Production Economics

Volumn 83, Issue 1, 2003, Pages 1-12

  Sen, Tapan ^a   Sulek, Joanne M ^a   Dileepan, Parthasarati ^b  

^a NC AandT State University   (United States)

^b UNIVERSITY OF TENNESSEE AT CHATTANOOGA   (United States)

Author keywords

Multi machine scheduling; Single machine scheduling; Total tardiness; Total weighted tardiness

Indexed keywords

HEURISTIC METHODS; MACHINE DESIGN; MECHANICAL ENGINEERING; OPTIMIZATION;

TOTAL TARDINESS (TT);

PRODUCTION ENGINEERING;

EID: 0037464639     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(02)00265-7     Document Type: Article

References (75)

1. Abdul-Razaq T.S., Potts C.N., Van Wassenhove L.N. A survey of algorithms for the single machine total weighted tardiness problem. Discrete Applied Mathematics. 26:1990;235-253.
2. Akturk M.S., Yildirim M.B. A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research. 25:1998;265-278.
3. Alidaee B., Gopalan S. A note on the equivalence of two heuristics to minimize total tardiness. European Journal of Operational Research. 96:1997;514-517.
4. Alidaee B., Rosa D. Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers and Operations Research. 24:1997;775-788.
5. Arkin E.M., Roundy R.O. Weighted tardiness scheduling on parallel machines with proportional weights. Operations Research. 39:1991;64-81.
6. Azizoglu M., Kirca O. Tardiness minimization on parallel machines. International Journal of Production Economics. 55:1998;163-168.
7. Baker K.R. Introduction to Sequencing and Scheduling. 1974;Wiley, New York.
8. Baker K.R., Kanet J.J. Job shop scheduling with modified due dates. Journal of Operations Management. 4:1983;11-22.
9. Baker K.R., Martin J.B. An experimental comparison of solution algorithms for the single machine tardiness problem. Naval Logistics Quarterly. 20:1974;187-199.
10. Baker K.R., Schrage L. Finding an optimal sequence by dynamic programming. an extension to precedence-related tasks Operations Research. 26:1978;111-120.
11. Barman S. The impact of priority rule combinations on lateness and tardiness. IIE Transactions. 30:1998;495-504.
12. Ben-Daya M., Al-Fawzan M. A simulated annealing approach for the one machine mean tardiness problem. European Journal of Operational Research. 93:1996;61-67.
13. Ben-Daya M., Duffuaa S.O., Raouf A. Minimizing mean tardiness to unspecified minimum number of tardy jobs. European Journal of Operational Research. 89:1996;100-107.
14. Bernardo J.J., Lin K. An interactive procedure for bi-criteria production scheduling. Computers and Operations Research. 21:1994;677-688.
15. Chang S., Lu Q., Tang G., Yu W. On decomposition of the total tardiness problem. Operations Research Letters. 17:1995;221-229.
16. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. 1967;Addison-Wesley, Reading, MA.
17. Crauwels H.A.J., Potts C.N., Van Wassenhove L.N. Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing. 10:1998;341-350.
18. Davis J.S., Kanet J.J. Single machine scheduling with early and tardy completion costs. Naval Research Logistics. 40:1993;85-101.
19. Du J., Leung J.Y.T. Minimizing total tardiness on one machine np-hard problems. Mathematics of Operations Research. 15:1990;483-495.
20. Eilon, S., 1979. Production scheduling. In: Hayley, K.B. (Ed.), OR '78. North-Holland, Amsterdam, pp. 237-266.
21. Eilon S., Chowdhury I.G. Minimizing waiting time variance in the single machine problem. Management Science. 23:1977;567-575.
22. Elmaghraby S.E. The one machine scheduling problem with delay costs. Journal of Industrial Engineering. 19:1968;105-108.
23. Emmons H. One machine sequencing to minimize certain functions of job tardiness. Operations Research. 17:1969;701-715.
24. Fadlalla A., Evans J.R., Levy M.S. A greedy heuristic for the mean tardiness sequencing problem. Computers and Operations Research. 21:1994;329-336.
25. Federgruen A., Mosheiov G. Greedy heuristics for single machine problems with general earliness and tardiness costs. Operations Research Letters. 16:1994;199-208.
26. Federgruen A., Mosheiov G. Single machine scheduling problems with general breakdowns, earliness and tardiness costs. Operations Research. 45:1997;66-71.
27. Fisher M.L. A dual problem for the one machine scheduling problem. Mathematics Programming. 11:1976;229-251.
28. Fry T.D., Vickens L., MacLeod K., Fernandez S. A heuristic solution procedure to minimize t bar on a single machine. Journal of the Operational Research Society. 40:1989;293-297.
29. Gelders L.F., Sambandam N. Four simple heuristics for scheduling a flowshop. International Journal of Production Research. 16:1978;221-231.
30. Held M., Karp R.M. A dynamic programming approach to sequencing problems. SIAM Journal. 10:1962;196-210.
31. Holsenback J.E., Russell R.M. A heuristic algorithm for sequencing on one machine to minimize total tardiness. Journal of the Operational Research Society. 43:1992;53-62.
32. Ibaraki T., Nakamura Y. A dynamic programming method for single machine scheduling. European Journal of Operational Research. 76:1994;72-82.
33. James R.J.W., Buchanan J.T. Performance enhancements to tabu search for the early/tardy scheduling problem. European Journal of Operational Research. 106:1998;254-265.
34. Kao E.P.C., Queyranne M. On dynamic programming methods for assembly line balancing. Operations Research. 30:1982;375-390.
35. Kim Y.D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society. 44:1993;19-28.
36. Koulamas C. The total tardiness problem. Review and extensions Operations Research. 42:1994;1025-1041.
37. Koulamas C. A total tardiness problem with pre-processing included. Naval Research Logistics. 43:1996;721-735.
38. Koulamas C. Polynomially solvable total tardiness problems. review and extensions Omega. 25:1997;235-239.
39. Koulamas C. Decomposition and hybrid simulated annealing heuristics for the parallel machine total tardiness problem. Naval Research Logistics. 44:1997;109-125.
40. Lawler E.L. On scheduling problems with deferral costs. Management Science. 11:1964;280-288.
41. Lawler E.L. A "pseudo polynomial" algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics. 1:1977;331-342.
42. Lawler E.L. A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters. 1982(1):1982;207-208.
43. Lawler, E.L., 1979. Efficient implementation of dynamic programming algorithms for sequencing problems. Report BW 106. Mathematisch Centrum, Amsterdam.
44. Lenstra J.K., Rinnooy Kan A.H.G. Complexity results for scheduling chains on a single machine. European Journal of Operational Research. 4:1980;270-275.
45. Li G. Single machine earliness and tardiness scheduling. European Journal of Operational Research. 96:1997;546-558.
46. Li C., Cheng T.C.E. The parallel machine min-max weighted absolute lateness scheduling problem. Naval Research Logistics. 41:1994;33-46.
47. Ow P.S. Focused scheduling in proportionate flowshops. Management Science. 31:1985;852-869.
48. Panwalkar S.S., Smith M.L., Koulamas C.P. A heuristic for the single machine tardiness problem. European Journal of Operational Research. 70:1993;304-310.
49. Picard J., Queyranne M. The time-dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling. Operations Research. 26:1978;86-110.
50. Potts C.N., Van Wassenhove L.N. A decomposition algorithm for the single machine tardiness problem. Operations Research Letters. 1982(1):1982;177-181.
51. Potts C.N., Van Wassenhove L.N. A branch-and-bound algorithm for the weighted tardiness problem. Operations Research. 33:1985;363-377.
52. Potts C.N., Van Wassenhove L.N. Dynamic programming and decomposition approaches for the single machine total tardiness problem. European Journal of Operational Research. 32:1987;405-414.
53. Potts C.N., Van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions. 23:1991;346-354.
54. Rachamadugu R.M.V. A note on the weighted tardiness problem. Operations Research. 35:1987;450-451.
55. Raman N., Talbot F.B. The jobshop tardiness problem. A decomposition approach European Journal of Operational Research. 69:1993;187-199.
56. Rinnooy Kan A.H.G., Lageweg B.J., Lenstra J.K. Minimizing total costs in one machine scheduling. Operations Research. 23:1975;908-927.
57. Russell R.M., Holsenback J.E. Evaluation of leading heuristics for the single machine tardiness problem. European Journal of Operational Research. 96:1997;538-545.
58. Russell R.M., Holsenback J.E. Evaluation of greedy, myopic and less greedy heuristics for the single machine, total tardiness problem. Journal of the Operational Research Society. 48:1997;640-646.
59. Sabuncuoglu I., Gurgun B. A neural model for scheduling problems. European Journal of Operational Research. 93:1996;288-299.
60. Schild L., Fredman K.R. Scheduling tasks with linear loss functions. Management Science. 7:1961;280-285.
61. Schrage L., Baker K.R. Dynamic programming solution of sequencing problems with precedence constraints. Operations Research. 26:1978;444-449.
62. Sen T., Borah B.N. On the single machine scheduling problem with tardiness penalties. Journal of the Operational Research Society. 42:1991;695-702.
63. Sen T., Austin L.M., Ghandforoush P. An algorithm for the single machine sequencing problem to minimize total tardiness. IIE Transactions. 15:1983;363-366.
64. Sen T., Dileepan P., Gupta J.N.D. The two machine flowshop problem with total tardiness. Computers and Operations Research. 16:1989;333-340.
65. Singer M., Pinedo M. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions. 30:1998;109-118.
66. Shwimer J. On the n-job one machine sequence-independent scheduling problem with tardiness penalties. A branch-and-bound solution Management Science. 18:1972;301-313.
67. Smith W.E. Various optimizers for single state production. Naval Research Logistics Quarterly. 3:1956;59-66.
68. Sridharan V., Zhou Z. A decision theory based scheduling procedure for single machine weighted earliness and tardiness problems. European Journal of Operational Research. 94:1996;292-301.
69. Srinivasan V. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly. 18:1971;317-327.
70. Szwarc W., Liu J.J. Weighted tardiness single machine scheduling with proportional weights. Management Science. 39:1993;626-632.
71. Szwarc W., Mukhopadhyay S. Decomposition of the single machine total tardiness problem. Operations Research Letters. 19:1996;243-250.
72. Tansel B.C., Sabuncuoglu I. New insights on the single machine total tardiness problem. Journal of the Operational Research Society. 48:1997;82-89.
73. Vairaktarakis G., Lee C. The single machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs. IIE Transactions. 27:1995;250-256.
74. Wilkerson L.J., Irwin J.D. An improved algorithm for scheduling independent tasks. AIIE Transactions. 3:1971;239-245.
75. Yu W. Augmentation of consistent partial orders for the one machine total tardiness problem. Discrete Applied Mathematics. 68:1996;189-202.