High Multiplicity in Earliness-Tardiness Scheduling

References

• Alon N., Spencer J. H.The Probabilistic Method (1992) (John Wiley and Sons, New York) Google Scholar
• 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 Res. Logist. (1987) 34:739–751Crossref, Google Scholar
• Baker K. R., Scudder G. D. Sequencing with earliness and tardiness penalties: A review. Oper. Res. (1990) 38:22–36Link, Google Scholar
• Clifford J. J. Machine scheduling with high multiplicity. (1997) . Dissertation, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, OHGoogle Scholar
• Clifford J. J., Posner M. E. Parallel machine scheduling with high multiplicity. Math. Programming. (1995) . ForthcomingGoogle Scholar
• Federgruen A., Mosheiov G. Heuristics for multimachine scheduling problems with earliness and tardiness costs. Management Sci. (1996) 42:1544–1555Link, Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: a survery. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Granot F., Skorin-Kapov J. On polynomial solvability of the high multiplicity total weighted tardiness problem. Discrete Appl. Math. (1993) 41:139–146Crossref, Google Scholar
• Hall N. G., Posner M. E. Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper. Res. (1991) 39:836–846Link, Google Scholar
• Hochbaum D. S., Shamir R. Minimizing the number of tardy job units under release time constraints. Discrete Appl. Math. (1990) 28:45–57Crossref, Google Scholar
• Hochbaum D. S., Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper. Res. (1991) 39:648–653Link, Google Scholar
• Hochbaum D. S., Shamir R., Shanthikumar J. G. A polynomial algorithm for an integer quadratic nonseparable transportation problem. Math. Programming (1992) 55:359–376Crossref, Google Scholar
• Hochbaum D. S., Shanthikumar J. G. Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach. (1990) 37:843–862Crossref, Google Scholar
• Kanet J. J. Minimizing the average deviation of job completion times about a common due date. Naval Res. Logist. Quart. (1981) 28:643–651Crossref, Google Scholar