Integrated production and distribution planning for perishable food products

  • Poorya Farahani
  • M. Grunow
  • H.-O. Günther


Certain types of food, such as catering foods, decay very rapidly. This paper investigates how the quality of such foods can be improved by shortening the time interval between production and delivery. To this end, we develop an approach that integrates short-term production and distribution planning in an iterative scheme. Further, an aggregation scheme is developed as the interface between the production scheduling and distribution problem. The production scheduling problem is solved through an MILP modeling approach which is based on a block planning formulation. Our implementation shows promising results, elaborated in a numerical investigation, which recollects the real settings of a catering company located in Denmark.


Production scheduling Block planning Vehicle routing Catering industry Food quality 


  1. Adenso-Diaz B, Gonzalez M, Garcia E (1998) A hierarchical approach to managing dairy routing. Interfaces 28(2):21–31CrossRefGoogle Scholar
  2. Akkerman R, Farahani P, Grunow M (2010) Quality, safety and sustainability in food distribution: a review of quantitative operations management approaches and challenges. OR Spectr 32:863–904MATHCrossRefGoogle Scholar
  3. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times and costs. Eur J Oper Res 187:985–1032MathSciNetMATHCrossRefGoogle Scholar
  4. Ambrosino D, Sciomachen A (2007) A food distribution network problem: a case study. IMA J Manag Math 18:33–53MATHCrossRefGoogle Scholar
  5. Arbib C, Pacciarelli D, Smriglio S (1999) A three-dimensional matching model for perishable production scheduling. Disc Appl Math 92:1–15MathSciNetMATHCrossRefGoogle Scholar
  6. Belenguer JM, Benavent E, Martinez MC (2005) RutaRep: a computer package to design dispatching routes in the meat industry. J Food Eng 70:435–445CrossRefGoogle Scholar
  7. Bilgen B, Günther H-O (2010) Integrated production and distribution planning in the fast moving consumer goods industry: a block planning application. OR Spectr 32:927–955MATHCrossRefGoogle Scholar
  8. Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58(1):130–148MATHCrossRefGoogle Scholar
  9. Chen HK, Hsueh CF, Chang MS (2009) Production scheduling and vehicle routing with time windows for perishable food products. Comput Oper Res 36:2311–2319MathSciNetMATHCrossRefGoogle Scholar
  10. Günther H-O, Neuhaus U (2004) Advanced planning and scheduling in the consumer goods industry: realizing block planning concepts for make-and-pack production using MILP modelling and SAP’s APO software. Oper Manag Change Agent 2:757–766Google Scholar
  11. Günther H-O, Grunow M, Neuhaus U (2006) Realizing block planning concept in make-and-pack production using MILP modelling and SAP APO. Int J Prod Res 44:3711–3726MATHCrossRefGoogle Scholar
  12. Higgins A, Beashel G, Harrison A (2006) Scheduling of brand production and shipping within a sugar supply chain. J Oper Res Soc 57(5):490–498MATHCrossRefGoogle Scholar
  13. Hsu CI, Hung SF, Li HC (2007) Vehicle routing problem with time-windows for perishable food delivery. J Food Eng 80:65–475CrossRefGoogle Scholar
  14. Kiranoudis CD, Tarantilis CT (2001) A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng 50:1–9CrossRefGoogle Scholar
  15. Kiranoudis CD, Tarantilis CT (2002) Distribution of fresh meat. J Food Eng 51:85–91CrossRefGoogle Scholar
  16. Lütke Entrup M, Günther H-O, Van Beek P, Grunow M, Seiler T (2005) Mixed-integer linear programming approaches to shelf-life-integrated planning and scheduling in yoghurt production. Int J Prod Res 43:5071–5100CrossRefGoogle Scholar
  17. Osvald A, Stirn LZ (2008) A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J Food Eng 85:285–295CrossRefGoogle Scholar
  18. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40:455–472CrossRefGoogle Scholar
  19. Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, University of Strathclyde, ScotlandGoogle Scholar
  20. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time windows constraints. Oper Res 35:254–265MathSciNetMATHCrossRefGoogle Scholar
  21. Sun X, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113–124Google Scholar
  22. Taylor E (2008) A new method of HACCP for the catering and food service industry. Food Control 19:126–134CrossRefGoogle Scholar
  23. Zheng W, Hu X, Zeng AZ (2007) A two-stage solution procedure for food delivery decisions in cities with circular transportation networks. IEEE Int Conf Serv Oper Logist Inform. doi: 10.1109/SOLI.2007.4383892
  24. Zhu X, Wilhelm WE (2006) Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Trans 38:987–1007CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Business Administration-Production and Supply Chain ManagementTechnical University of MunichMunichGermany
  2. 2.Department of Production ManagementTechnical University of BerlinBerlinGermany

Personalised recommendations