Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

References

• Alidaee B., Ahmadian A. Two parallel machine sequencing problems involving controllable job processing times. Eur. J. Oper. Res. (1993) 70:335–341Crossref, Google Scholar
• Armstrong R., Gu S., Lei L. An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. J. Oper. Res. Soc. (1995) 46:116–122Google Scholar
• Armstrong R., Gu S., Lei L. Solving a class of two-resource allocation problem by equivalent load method. J. Oper. Res. Soc. (1997) 48:818–825Crossref, Google Scholar
• Baker K. R., Scudder G. D. Sequencing with earliness and tardiness penalties: A review. Oper. Res. (1990) 38:22–36Link, Google Scholar
• Biskup D., Jahnke H. Common due date assignment for scheduling on a single machine with jointly reducible processing times. Internat. J. Production Econom. (2001) 69:317–322Crossref, Google Scholar
• Cheng T. C. E., Janiak A., Kovalyov M. Y. Bicriterion single machine scheduling with resource dependent processing times. SIAM J. Optim. (1998) 8(2):617–630Crossref, Google Scholar
• De P., Ghosh J. B., Wells C. E. Optimal delivery time quotation and order sequencing. Decision Sci. (1991) 22:379–390Crossref, Google Scholar
• Hardy G. H., Littlewood J. E., Polya G.Inequalities (1934) (Cambridge University Press, New York) Google Scholar
• Hoogeveen H., Woeginger G. J. Some comments on sequencing with controllable processing times. Computing (2002) 68:181–192Crossref, Google Scholar
• Gordon V., Proth J. M., Chu C. B. A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. (2002a) 139:1–25Crossref, Google Scholar
• Gordon V., Proth J. M., Chu C. B. Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning Control (2002b) 13(2):117–132Crossref, Google Scholar
• Hall N., Potts C. N. Supply chain scheduling: Batching and delivery. Oper. Res. (2003) 51(4):566–584Link, Google Scholar
• Janiak A. One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika (1987) 23(4):289–293Google Scholar
• Janiak A., Kovalyov M. Y. Single machine scheduling subject to deadlines and resource dependent processing times. Eur. J. Oper. Res. (1996) 94:284–291Crossref, Google Scholar
• Kahlbacher H. G., Cheng T. C. E. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Appl. Math. (1993) 47:139–164Crossref, Google Scholar
• Karp R. M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) Crossref, Google Scholar
• Monma C. L., Schrijver A., Todd M. J., Wei V. K. Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Math. Oper. Res. (1990) 15:736–748Link, Google Scholar
• Ng C. T. D., Cheng T. C. E., Janiak A., Kovalyov M. Y. Group scheduling with controllable setup and processing times: Minimizing total weighted completion time. Ann. Oper. Res. (2005) 133:163–174Crossref, Google Scholar
• Ng C. T. D., Cheng T. C. E., Kovalyov M. Y., Lam S. S. Single machine scheduling with a variable common due date and resource-dependent processing times. Comput. Oper. Res. (2003) 30:1173–1185Crossref, Google Scholar
• Nowicki E., Zdrzalka S. A survey of results for sequencing problems with controllable processing times. Discrete Appl. Math. (1990) 26:271–287Crossref, Google Scholar
• Papadimitriou C. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Sahni S. Algorithms for scheduling independent tasks. J. Assoc. Comput. Machinery (1976) 23:116–127Crossref, Google Scholar
• Scott S. C., Jefferson T. R. Allocation of resources in project management. Internat. J. Systems Sci. (1995) 26(2):413–420Crossref, Google Scholar
• Shabtay D. Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem. Comput. Oper. Res. (2004) 31(8):1303–1315Crossref, Google Scholar
• Shabtay D., Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. (2004) 31(13):2279–2289Crossref, Google Scholar
• Shabtay D., Steiner G. Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. (2006) 34:683–691Crossref, Google Scholar
• Slotnick S. A., Sobel M. J. Manufacturing lead-time rules: Customer retention versus tardiness costs. Eur. J. Oper. Res. (2005) 169:825–856Crossref, Google Scholar
• Trick M. Scheduling multiple variable-speed machines. Oper. Res. (1994) 42:234–248Link, Google Scholar
• Van Wassenhove L., Baker K. R. A bicriterion approach to time/cost trade-offs in sequencing. Eur. J. Oper. Res. (1982) 11:48–54Crossref, Google Scholar