[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Integrated production and distribution scheduling with lifespan constraints

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Algorithm 1
Algorithm 2
Algorithm 3

Similar content being viewed by others

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: review and extensions. Operations Research, 58(1), 130–148.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Garcia, J. M., & Lozano, S. (2005). Production and delivery scheduling problem with time windows. Computers & Industrial Engineering, 48(4), 733–742.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic.

    Book  Google Scholar 

  • 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 

  • Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285–305.

    Article  Google Scholar 

  • Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Viergutz, C. (2011). Integrated production and distribution scheduling. PhD thesis, University of Osnabrück, Department of Mathematics and Computer Science.

Download references

Acknowledgements

We gratefully acknowledge the constructive comments of two anonymous referees.

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Osnabrück, Albrechtstr. 28, 49076, Osnabrück, Germany

    Christian Viergutz & Sigrid Knust

Authors
  1. Christian Viergutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sigrid Knust
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sigrid Knust.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Viergutz, C., Knust, S. Integrated production and distribution scheduling with lifespan constraints. Ann Oper Res 213, 293–318 (2014). https://doi.org/10.1007/s10479-012-1197-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1197-z

Keywords

Search

Navigation