Journal of Scheduling

, Volume 18, Issue 1, pp 3–13 | Cite as

Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs



There are many situations when, due to unexpected delays, the supplier may not be able to deliver some orders by the promised due dates. We present a model for quoting attainable delivery times to minimize tardiness penalties and delivery costs, when deliveries take place in batches. We show that the general problem is strongly \({\mathcal {NP}}\)-hard, but when all orders have the same per-unit due-date-assignment cost, it is \({\mathcal {NP}}\)-hard only in the ordinary sense. For the latter case, we present a pseudo-polynomial algorithm, which is converted into a fully polynomial-time approximation scheme. If the tardiness penalties are also identical, we show that the problem can be solved in polynomial time.


Scheduling Tardiness Delivery times Approximation algorithm 



This research was supported in part by NSERC Discovery Grant 1708-09.


  1. Brucker, P., & Kovalyov, M. Y. (1996). Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research, 43, 1–8.CrossRefGoogle Scholar
  2. Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58, 130–148.CrossRefGoogle Scholar
  3. Chen, Z.-L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51, 614–628.CrossRefGoogle Scholar
  4. Chubanov, S., Kovalyov, M., & Pesch, E. (2006). An FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structure. Mathematical Programming Series A, 106, 453–466.CrossRefGoogle Scholar
  5. Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics, 3(4), 313–318.CrossRefGoogle Scholar
  6. Gordon, V. S., Proth, J.-M., & Chu, C. (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(3), 1–25.CrossRefGoogle Scholar
  7. Gordon, V. S., Proth, J.-M., & Chu, C. (2002b). Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning and Control, 13(2), 117–132.CrossRefGoogle Scholar
  8. Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2004). Scheduling with due date assignment. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (Vol. 21, pp. 1–22). Boca Raton, FL: CRC Press.Google Scholar
  9. Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4), 566–584.CrossRefGoogle Scholar
  10. Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: Minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79–86.CrossRefGoogle Scholar
  11. Ibarra, O., & Kim, C. E. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the Associahon for Computing Machinery, 22, 463–468.CrossRefGoogle Scholar
  12. Kaminsky, P., & Hochbaum, D. S. (2004). Due date quotation models and algorithms. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 20-1–20-22). Boca Raton, FL: CRC Press.Google Scholar
  13. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations. New York: Plenum Press.Google Scholar
  14. Lawler, E. L. (1982). A fully polynomial time approximation scheme for the total tardiness problem. Operations Research Letters, 1(6), 207–208.CrossRefGoogle Scholar
  15. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimzing the number of late jobs. Management Science, 15, 102–109.CrossRefGoogle Scholar
  16. Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116–127.CrossRefGoogle Scholar
  17. Shabtay, D., & Steiner, G. (2006). Two due date assignment problems in scheduling a single machine. Operations Research Letters, 34(6), 683–691.CrossRefGoogle Scholar
  18. Slotnick, S. A., & Sobel, M. J. (2005). Manufacturing lead-time rules: Customer retention versus tardiness costs. European Journal of Operational Research, 169, 825–856.CrossRefGoogle Scholar
  19. Steiner, G., & Zhang, R. (2007). Minimizing the weighted number of late jobs with batch setup times and delivery costs on a single machine. In E. V. Levner (Ed.), Multiprocessor scheduling, theory and applications (pp. 85–98). Vienna: Itech Education and Publishing.Google Scholar
  20. Steiner, G., & Zhang, R. (2011). Revised delivery-time quotation in scheduling with tardiness penalties. Operations Research, 59(6), 1504–1511.CrossRefGoogle Scholar
  21. Thomas, D. J., & Griffin, P. M. (1996). Coordinated supply chain management. European Journal of Operational Research, 94, 1–15.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringMcMaster UniversityHamiltonCanada
  2. 2.Operations Management Area, DeGroote School of BusinessMcMaster UniversityHamiltonCanada

Personalised recommendations