A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

References

• Baker K. R., Scudder G. D. Scheduling with earliness and tardiness penalties: A review. Oper. Res. (1990) 38:22–36Link, Google Scholar
• Gens G. V., Levner E. V. Fast approximation algorithms for knapsack type problems. Lecture Notes Control Inform. Sci. (1980) 23:185–194Crossref, 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
• Horowitz E., Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM (1976) 23:317–327Crossref, Google Scholar
• Jurisch B., Kubiak W., Jozefowska J. Algorithms for MinClique scheduling problems. Discrete Appl. Math. (1997) 72:115–139Crossref, Google Scholar
• Kovalyov M. Y., Potts C. N., Van Wassenhove L. N. A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Math. Oper. Res. (1994) 19:86–93Link, Google Scholar
• Kovalyov M. Y. A Rounding technique to construct approximation algorithms for knapsack and partition-type problems. Appl. Math. Comput. Sci. (1996) 6:789–801Google Scholar
• Kubiak W., van de Velde S. Scheduling deteriorating jobs to minimize makespan. Naval Res. Logist. (1998) 45:511–523Crossref, Google Scholar
• Smith W. E. Various optimizers for single-stage production. Naval Res. Logist. Quart. (1956) 3:59–66Crossref, Google Scholar