Advertisement

Annals of Operations Research

, Volume 213, Issue 1, pp 293–318 | Cite as

Integrated production and distribution scheduling with lifespan constraints

  • Christian Viergutz
  • Sigrid KnustEmail author
Article

Abstract

We consider an integrated production and distribution scheduling problem in a make-to-order business scenario. A product with a short lifespan (e.g., perishable or seasonal) is produced at a single production facility with a limited production rate. This means that the product expires in a constant time after its production is finished. Orders are received from a set of geographically dispersed customers, where a demand for the product and a time window for the delivery is associated with each customer for the planning period. A single vehicle with non-negligible traveling times between the locations is responsible for the deliveries. Due to the limited production and distribution resources, possibly not all customers may be supplied within their time windows or the lifespan. The problem consists in finding a selection of customers to be supplied such that the total satisfied demand is maximized. We extend the work by Armstrong et al. (Annals of Operations Research 159(1):395–414, 2008) on the problem for fixed delivery sequences by pointing out an error in their branch and bound algorithm and presenting a corrected variant. Furthermore, we introduce model extensions for handling delays of the production start as well as for variable production and distribution sequences. Efficient heuristic solution algorithms and computational results for randomly generated instances are presented.

Keywords

Scheduling Make-to-order production Supply chain management Limited lifespan Time windows 

Notes

Acknowledgements

We gratefully acknowledge the constructive comments of two anonymous referees.

References

  1. Armstrong, R., Gao, S., & Lei, L. (2008). A zero-inventory production and distribution problem with a fixed customer sequence. Annals of Operations Research, 159(1), 395–414. CrossRefGoogle Scholar
  2. Azi, N., Gendreau, M., & Potvin, J. Y. (2007). An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178(3), 755–766. CrossRefGoogle Scholar
  3. Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: review and extensions. Operations Research, 58(1), 130–148. CrossRefGoogle Scholar
  4. Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581. CrossRefGoogle Scholar
  5. Garcia, J. M., & Lozano, S. (2005). Production and delivery scheduling problem with time windows. Computers & Industrial Engineering, 48(4), 733–742. CrossRefGoogle Scholar
  6. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman. Google Scholar
  7. Geismar, H. N., Laporte, G., Lei, L., & Sriskandarajah, C. (2008). The integrated production and transportation scheduling problem for a product with a short lifespan. INFORMS Journal on Computing, 20(1), 21–33. CrossRefGoogle Scholar
  8. Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic. CrossRefGoogle Scholar
  9. Lourenço, H., Martin, O., & Stützle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321–353). Dordrecht: Kluwer Academic. Google Scholar
  10. Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285–305. CrossRefGoogle Scholar
  11. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265. CrossRefGoogle Scholar
  12. Stecke, K. E., & Zhao, X. (2007). Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manufacturing Service Operations Management, 9(2), 206–224. CrossRefGoogle Scholar
  13. Tarantilis, C. D., & Kiranoudis, C. T. (2001). A meta-heuristic algorithm for the efficient distribution of perishable foods. Journal of Food Engineering, 50(1), 1–9. CrossRefGoogle Scholar
  14. Tsirimpas, P., Tatarakis, A., Minis, I., & Kyriakidis, E. G. (2008). Single vehicle routing with a predefined customer sequence and multiple depot returns. European Journal of Operational Research, 187(2), 483–495. CrossRefGoogle Scholar
  15. Van Buer, M. G., Woodruff, D. L., & Olson, R. T. (1999). Solving the medium newspaper production/distribution problem. European Journal of Operational Research, 115(2), 237–253. CrossRefGoogle Scholar
  16. Viergutz, C. (2011). Integrated production and distribution scheduling. PhD thesis, University of Osnabrück, Department of Mathematics and Computer Science. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of OsnabrückOsnabrückGermany

Personalised recommendations