Single-machine scheduling of unit-time jobs with earliness and tardiness penalties

Mathematics of Operations Research

Volumn 23, Issue 4, 1998, Pages 930-943

  Verma, Sushil ^a   Dessouky, Maged ^a  

^a University of Southern California   (United States)

Author keywords

Earliness and tardiness penalties; Linear programming; Single machine scheduling; Unit time jobs

Indexed keywords

CRITICAL PATH ANALYSIS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; PROCESS CONTROL; RELAXATION PROCESSES; SCHEDULING;

DOMINANCE CONDITIONS; GENERAL WEIGHTED SYMMETRIC PENALTY STRUCTURES; POLYNOMIAL-TIME SOLUTION METHOD; SINGLE-MACHINE SCHEDULING;

JUST IN TIME PRODUCTION;

EID: 0032209032     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.4.930     Document Type: Article

References (22)

1. Baker, K. 1974. Introduction to Sequencing and Scheduling, John Wiley and Sons, New York.
2. _, L Schrage, 1978. Finding an optimal sequence by dynamic programming : an extension to precedence-related tasks. Oper. Res. 26 111-120.
3. _, G. Scudder 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38 22-36.
4. Dessouky, M., B. Kijowski, S. Verma 1998. Simultaneous batching and scheduling for chemical processing with earliness and tardiness penalties. Technical Report Number 1998-01, University of Southern California, Los Angeles, CA.
5. Fisher, M. 1976. A dual algorithm for the one-machine scheduling problem. Math . Programming 11 229-251.
6. Garey, M., R. Tarjan, G. Wilfong 1988. One-process scheduling with symmetric earliness and tardiness penalties. Math, Oper. Res. 13 330-348.
7. Grötschel, M., L. Lovász, A. Schrijver 1980. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, Berlin.
8. Hall, N., M. Posner 1991. Earliness-tardiness scheduling problems i: Weighted deviation of completion times about a common due date. Oper. Res. 39 836-846.
9. Kanet, J. 1981. Minimizing the average deviation of job completion times about a common due date. Naval Res. Logist. Quart. 28 643-651.
10. Kramer, F.-J., C.-Y. Lee 1993. Common due-window scheduling. Production and Oper. Management 2 262-275.
11. Lawler, E. 1964. On scheduling problems with deferral costs. Management Sci. 11 280-288.
12. _ 1977. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 331-342.
13. Lenstra, J., A. R. Kan 1985. Sequencing and Scheduling, in Combinatorial Optimization: Annotated Bibliographies, O'hEighertaigh et al., eds. John Wiley and Sons, New York.
14. _, _, P. Brucker 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
15. Murthy, K. G. 1983. Linear Programming, John Wiley and Sons, New York.
16. Nemhauser, G. L., L. A. Wolsey 1988. Integer and Combinatorial Optimization. John Wiley and Sons, New York.
17. Ow, P., T. Morton 1989. The single machine early/tardy problem. Management Sci. 35 177-191.
18. Potts, C., L. V. Wassenhove, 1985. A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33 363-377.
19. Rachamadugu, R., T. Morton 1983. Myopic heuristics for the single machine weighted tardiness problem. Working paper 30-82-83. Technical report, Carnegie Mellon University, Pittsburgh, PA.
20. Royden, H. 1968. Real Analysis. Macmillan Publishing Co., Inc., .
21. Schrage, L., K. Baker 1978. Dynamic programming solution of sequencing problems with precedence constraints. Oper. Res. 26 444-449.
22. Yano, C., Y. Kim 1991. Algorithms for single machine scheduling problems minimizing tardiness and earliness. European J. Oper. Res. 52 167-178.