Machine scheduling with earliness, tardiness and non-execution penalties

Computers and Operations Research

Volumn 32, Issue 3, 2005, Pages 683-705

  Hassin, Refael ^a   Shani, Mati ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NONE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; SET THEORY; THEOREM PROVING;

JUST-IN-TIME (JIT) PHILOSOPHY; MEDIAN VALUES; PENALTIES; TARDINESS;

MACHINE COMPONENTS;

EID: 4744340577     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.08.012     Document Type: Article

References (37)

1. Garey M.R., Tarjan R.E., Wilfong G.T. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research. 13(2):1988;330-348.
2. Gordon V., Proth J.-M., Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research. 139:2002;1-25.
3. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties. a review Operations Research. 38(1):1990;22-36.
4. Kanet J.J. Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly. 28(4):1981;643-651.
5. Hall N.G. Single- and multiple-processor models for minimizing completion time variance. Naval Research Logistics Quarterly. 33(1):1986;49-54.
6. Bagchi U., Sullivan R.S., Chang Y.L. Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly. 33(2):1986;227-240.
7. Bagchi U., Chang Y.-L., Sullivan R.S. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Naval Research Logistics. 34(5):1987;739-751.
8. Hall N.G., Posner M.E. Earliness-tardiness scheduling problems, I. weighted deviation of completion times about a common due date Operations Research. 39(5):1991;836-846.
9. De P., Ghosh J.B., Wells C.E. On the minimization of completion time variance with a bi-criteria extension. Operations Research. 40:1992;1148-1155.
10. Jurisch B., Kubiak W., Józefowska J. Algorithms for minclique scheduling problems. Discrete Applied Mathematics. 72:1997;115-139.
11. Kovalyov M.Y., Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research. 47(5):1999;757-761.
12. Szwarc W. The weighted common due date single machine scheduling problem revisited. Computers & Operations Research. 23(3):1996;255-262.
13. Hoogeveen J.A., van de Velde S.L. Earliness-tardiness scheduling around almost equal due dates. INFORMS Journal on Computing. 9(1):1997;92-99.
14. James R.J.W., Buchanan J.T. A neighborhood scheme with a compressed solution space for the early/tardy scheduling problem. European Journal of Operational Research. 102(3):1997;513-527.
15. Davis J.S., Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Research Logistics. 40:1993;85-101.
16. Szwarc W., Mukhopadhyay S.K. Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics. 42:1995;1109-1114.
17. Fry T.D., Armstrong R.D., Blackstone J.H. Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions. 19(4):1987;445-450.
18. Fry T.D., Armstrong R.D., Rosen L.D. Single machine scheduling to minimize mean absolute lateness. a heuristic solution Computers & Operations Research. 17(1):1990;105-112.
19. Kim Y.-D., Yano C.A. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics. 41:1994;913-933.
20. Ow P.S., Morton T.E. The single machine early/tardy problem. Management Science. 35(2):1989;177-191.
21. Lee C.Y., Choi J.Y. A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers & Operations Research. 22(8):1995;857-869.
22. Verma S., Dessouky M. Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research. 23(4):1998;930-943.
23. Kanet J.J., Sridharan V. Scheduling with inserted idle time. problem taxonomy and literature review Operations Research. 48(1):2000;99-110.
24. Sundararaghavan P.S., Ahmed M.U. Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling. Naval Research Logistics Quarterly. 31(2):1984;325-333.
25. Emmons H. Scheduling to a common due date on parallel uniform processors. Naval Research Logistics. 34(6):1987;803-810.
26. Kubiak W., Lou S., Sethi S. Equivalence of mean flow time problems and mean absolute deviation problems. Operations Research Letters. 9(6):1990;371-374.
27. Webster S.T. The complexity of scheduling job families about a common due date. Operations Research Letters. 20(2):1997;65-74.
28. Chen Z.-L., Powell W.B. A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research. 116(1):1999;220-233.
29. Lageweg B.J., Lenstra J.K., Lawler E.L., Rinnooy Kan A.H.G. Computer-aided complexity classification of combinatorial problems. Communications of the ACM. 25(11):1982;817-822.
30. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH editors. Logistics of production & inventory; handbooks in operations research and management science, vol. 4. Amsterdam: North-Holland; 1993. p. 445-522.
31. Hall N.G., Kubiak W., Sethi S.P. Earliness-tardiness scheduling problems, II. deviation of completion times about a restrictive common due date Operations Research. 39(5):1991;847-856.
32. Raghavachari M. A V-Shape property of optimal schedule of jobs about a common due date. European Journal of Operational Research. 23(3):1986;401-402.
33. Kubiak W. Completion time variance minimization on a single machine is difficult. Operations Research Letters. 14:1993;49-59.
34. Szwarc W. Single-machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Research Logistics. 36(5):1989;663-673.
35. Hoogeveen J.A., Oosterhout H., van de Velde S.L. New lower and upper bounds for scheduling around a small common due date. Operations Research. 42(1):1994;102-110.
36. Federgruen A., Mosheiov G. Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs. Operations Research Letters. 16:1994;199-208.
37. Cai X., Lum V.Y.S., Chan J.M.T. Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties. European Journal of Operational Research. 98(1):1997;154-168.