Integrated production and distribution scheduling with lifespan constraints

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.

[1]  Sebastián Lozano,et al.  Production and delivery scheduling problem with time windows , 2005, Comput. Ind. Eng..

[2]  Lei Lei,et al.  A zero-inventory production and distribution problem with a fixed customer sequence , 2008, Ann. Oper. Res..

[3]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[4]  Zhi-Long Chen,et al.  Integrated Production and Outbound Distribution Scheduling: Review and Extensions , 2010, Oper. Res..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[7]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[8]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[9]  Kathryn E. Stecke,et al.  Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode , 2007, Manuf. Serv. Oper. Manag..

[10]  H. Neil Geismar,et al.  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan , 2008, INFORMS J. Comput..

[11]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[12]  Michel Gendreau,et al.  An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..

[13]  Christian Viergutz,et al.  Integrated production and distribution scheduling , 2011 .

[14]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[15]  Ioannis Minis,et al.  Single vehicle routing with a predefined customer sequence and multiple depot returns , 2008, Eur. J. Oper. Res..

[16]  Christos D. Tarantilis,et al.  A meta-heuristic algorithm for the efficient distribution of perishable foods , 2001 .