Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

References

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