Single-machine earliness-tardiness scheduling about a common due date with tolerances

International Journal of Production Economics

Volumn 42, Issue 3, 1996, Pages 217-227

  Weng, Michael X ^a   Ventura, Jose A ^b  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Dynamic programming algorithm; Job completion; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DYNAMIC PROGRAMMING; FITS AND TOLERANCES; MACHINERY; PRODUCTION;

DYNAMIC PROGRAMMING ALGORITHM; JOB COMPLETION; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 0030124979     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-5273(95)00200-6     Document Type: Article

References (16)

1. Raghavachari, M., 1988. Scheduling problems with non-regular penalty functions - A review. Opsearch, 25: 141-164.
2. Baker, K.R. and Scudder, G.D., 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res., 38: 22-36.
3. Kanet, J.J., 1981. Minimizing the average deviation of job completion times about a common due date. Naval Res. Logist. Quart., 28: 643-651.
4. Sundararaghavan, P. and Ahmed, M., 1984. Minimizing the sum of lateness in single-machine and multimachine scheduling. Naval Res. Logist. Quart., 31: 325-333.
5. Panwalker, S.S., Smith, M.L and Seidmann, A., 1982. Common due date assignment to minimize total penalty for the one machine sequencing problem. Oper. Res., 30: 391-399.
6. Raghavachari, M., 1986. A V-shaped property of optimal schedule of jobs about a common due date. Eur. Oper. Res., 23: 401-402.
7. Hall, N.G., 1986. Single and multi-processor models for minimizing completion time variance. Naval Res. Logist. Quart., 33: 49-54.
8. Bagchi, U., Sullivan, R. and Chang, Y., 1986. Minimizing mean absolute deviation of completion times about a common due date. Naval Res. Logist. Quart., 33: 227-240.
9. Hall, N.G., Kubiak, W. and Sethi, S.P., 1991. Earliness-tardiness scheduling problems II: Deviation of completion times about a restrictive common due date. Oper. Res., 39: 847-856.
10. Hoogeveen, J.A. and Van De Velde, S.L., 1991. Scheduling around a small common due date. Eur. Oper. Res., 55: 237-242.
11. Hall, N.G. and Posner, M.E., 1991. Earliness-tardiness scheduling problems I: Weighted deviation of completion times about a common due date. Oper. Res., 39: 836-846.
12. Cheng, T.C.E., 1988. Optimal common due date with limited completion time deviation. Comput. Oper. Res., 15: 91-96.
13. Dickman, B., Wilamowsky, Y. and Epstein, S., 1991. A note on optimal common due date with limited completion time. Comput. Oper. Res., 15: 125-127.
14. Weng, M.X. and Ventura, J.A., 1994. Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times. Naval Res. Logist., 14: 843-851.
15. Baker, K.R., 1974. Introduction to Sequencing and Sched-uling. Wiley, New York.
16. Garey, M.R., Tarjan, R.E. and Wilfong, G.T., 1988. One-processor scheduling with earliness and tardiness penalties. Math. Oper. Res., 13: 330-348.