A dynamic multi-plant lot-sizing and distribution problem

International Journal of Production Research

Volumn 54, Issue 22, 2016, Pages 6707-6717

  Darvish, Maryam ^a   Larrain, Homero ^b   Coelho, Leandro C ^a  

^a UNIVERSITÉ LAVAL   (Canada)

^b PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

distribution; dynamic lot sizing; integrated supply chain planning; inventory; optimization; physical internet; production

Indexed keywords

COMPETITION; COST BENEFIT ANALYSIS; CUSTOMER SATISFACTION; ECONOMIC AND SOCIAL EFFECTS; INVENTORY CONTROL; LOGISTICS; OPTIMIZATION; PRODUCTION; PRODUCTION CONTROL; SENSITIVITY ANALYSIS; SUPPLY CHAINS;

COMPETITIVE ADVANTAGE; COST OF PRODUCTIONS; DISTRIBUTION; DISTRIBUTION PROBLEM; DYNAMIC LOT-SIZING; INTEGRATED SUPPLY CHAIN; INVENTORY; TOTAL LOGISTICS COSTS;

PROBLEM SOLVING;

EID: 84961217278     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2016.1154623     Document Type: Article

References (38)

1. N.Absi, C.Archetti, S.Dauzère-Pérès, and D.Feillet. 2014. “A Two-phase Iterative Heuristic Approach for the Production Routing Problem.” Transportation Science 49 (4):784–795.
2. N.Absi, S.Kedad-Sidhoum, and S.Dauzère-Pérès. 2011. “Uncapacitated Lot-sizing Problem with Production Time Windows, Early Productions, Backlogs and Lost Sales.” International Journal of Production Research 49 (9):2551–2566.
3. Y.Adulyasak, J.-F.Cordeau, and R.Jans. 2014a. “Optimization-based Adaptive Large Neighborhood Search for the Production Routing Problem.” Transportation Science 48 (1):20–45.
4. Y.Adulyasak, J.-F.Cordeau, and R.Jans. 2014b. “Formulations and Branch-and-cut Algorithms for Multi-vehicle Production and Inventory Routing Problems.” INFORMS Journal on Computing 26 (1):103–120.
5. Y.Adulyasak, J.-F.Cordeau, and R.Jans. 2015. “The Production Routing Problem:A Review of Formulations and Solution Algorithms.” Computers & Operations Research 55:141–152.
6. A.Akbalik, and B.Penz. 2011. “Comparison of Just-in-time and Time Window Delivery Policies for a Single-item Capacitated Lot Sizing Problem.” International Journal of Production Research 49 (9):2567–2585.
7. B.Almada-Lobo, and R.J.W.James. 2010. “Neighbourhood Search Meta-heuristics for Capacitated Lot-sizing with Sequence-dependent Setups.” International Journal of Production Research 48 (3):861–878.
8. C.Almeder, 2010. “A Hybrid Optimization Approach for Multi-level Capacitated Lot-sizing Problems.” European Journal of Operational Research 200 (2):599–606.
9. C.Archetti, L.Bertazzi, G.Paletta, and M.G.Speranza. 2011. “Analysis of the Maximum Level Policy in a Production--distribution System.” Computers & Operations Research 12 (38):1731–1746.
10. H.C.Bahl, L.P.Ritzman, and J.N.D.Gupta. 1987. “OR Practice -- Determining Lot Sizes and Resource Requirements:A Review.” Operations Research 35 (3):329–345.
11. J.F.Bard, and N.Nananukul. 2010. “A Branch-and-price Algorithm for an Integrated Production and Inventory Routing Problem.” Computers & Operations Research 37 (12):2202–2217.
12. M.Boudia, M.A.O.Louly, and C.Prins. 2007. “A Reactive GRASP and Path Relinking for a Combined Production--Distribution Problem.” Computers & Operations Research 34 (11):3402–3419.
13. M.Boudia, and C.Prins. 2009. “A Memetic Algorithm with Dynamic Population Management for an Integrated Production--Distribution Problem.” European Journal of Operational Research 195 (3):703–715.
14. G.Brown, J.Keegan, B.Vigus, and K.Wood. 2001. “The Kellogg Company Optimizes Production, Inventory, and Distribution.” Interfaces 31 (6):1–15.
15. G.Bruno, A.Genovese, and C.Piccolo. 2014. “The Capacitated Lot Sizing Model:A Powerful Tool for Logistics Decision Making.” International Journal of Production Economics 155:380–390.
16. J.F.Camacho-Vallejo, R.Muñoz Sánchez, and J.L.González-Velarde. 2015. “A Heuristic Algorithm for a Supply Chain’s Production-distribution Planning.” Computers & Operations Research 61:110–121.
17. L.E.Cárdenas-Barrón, J.L.González-Velarde, and G.Treviño-Garza. 2015. “A New Approach to Solve the Multi-product Multi-period Inventory Lot Sizing with Supplier Selection Problem.” Computers & Operations Research 64:225–232.
18. H.Chen, 2015. “Fix-and-optimize and Variable Neighborhood Search Approaches for Multi-level Capacitated Lot Sizing Problems.” Omega 56:25–36.
19. H.-D.Chen, D.W.Hearn, and C.-Y.Lee. 1994. “A New Dynamic Programming Algorithm for the Single Item Capacitated Dynamic Lot Size Model.” Journal of Global Optimization 4 (3):285–300.
20. A.Clark, B.Almada-Lobo, and C.Almeder. 2011. “Lot Sizing and Scheduling:Industrial Extensions and Research Opportunities.” International Journal of Production Research 49 (9):2457–2461.
21. L.C.Coelho, J.-F.Cordeau, and G.Laporte. 2014. “Thirty Years of Inventory-routing.” Transportation Science 48 (1):1–19.
22. L.C.Coelho, and G.Laporte. 2013. “A Branch-and-cut Algorithm for the Multi-product Multi-vehicle Inventory-routing Problem.” International Journal of Production Research 51 (23–24):7156–7169.
23. A.Degbotse, B.T.Denton, K.Fordyce, R.J.Milne, R.Orzell, and C.T.Wang. 2013. “Ibm Blends Heuristics and Optimization to Plan its Semiconductor Supply Chain.” Interfaces 43 (2):130–141.
24. M.Florian, J.K.Lenstra, and A.H.G.Rinnooy Kan. 1980. “Deterministic Production Planning:Algorithms and Complexity.” Management Science 26 (7):669–679.
25. H.G.Goren, S.Tunali, and R.Jans. 2012. “A Hybrid Approach for the Capacitated Lot Sizing Problem with Setup Carryover.” International Journal of Production Research 50 (6):1582–1597.
26. R.Jans, and Z.Degraeve. 2007. “Meta-heuristics for Dynamic Lot Sizing:A Review and Comparison of Solution Approaches.” European Journal of Operational Research 177 (3):1855–1875.
27. R.Jans, and Z.Degraeve. 2008. “Modeling Industrial Lot Sizing Problems:A Review.” International Journal of Production Research 46 (6):1619–1643.
28. B.Karimi, S.M.T.F.Ghomi, and J.M.Wilson. 2003. “The Capacitated Lot Sizing Problem:A Review of Models and Algorithms.” Omega 31 (5):365–378.
29. Y.Li, Y.Tao, and F.Wang. 2012. “An Effective Approach to Multi-item Capacitated Dynamic Lot-sizing Problems.” International Journal of Production Research 50 (19):5348–5362.
30. J.Maes, J.O.McClain, and L.N.Van Wassenhove. 1991. “Multilevel capacitated lotsizing complexity and LP-based heuristics.” European Journal of Operational Research 53 (2):131–148.
31. B.Montreuil, 2011. “Toward a Physical Internet:Meeting the Global Logistics Sustainability Grand Challenge.” Logistics Research 3 (2–3):71–87.
32. B.Montreuil, R.D.Meller, and E.Ballot. 2013. “Physical Internet Foundations.” In Service Orientation in Holonic and Multi Agent Manufacturing and Robotics, 151–166. Springer Berlin Heidelberg.
33. F.Sahling, L.Buschkühl, H.Tempelmeier, and S.Helber. 2009. “Solving a Multi-level Capacitated Lot Sizing Problem with Multi-period Setup Carry-over via a Fix-and-optimize Heuristic.” Computers & Operations Research 36 (9):2546–2553.
34. M.Sambasivan, and S.Yahya. 2005. “A Lagrangean-based Heuristic for Multi-plant, Multi-item, Multi-period Capacitated Lot-sizing Problems with Inter-plant Transfers.” Computers & Operations Research 32 (3):537–555.
35. R.Sarraj, E.Ballot, S.Pan, D.Hakimi, and B.Montreuil. 2014. “Interconnected Logistic Networks and Protocols:Simulation-based Efficiency Assessment.” International Journal of Production Research 52 (11):3185–3208.
36. D.X.Shaw, and A.P.M.Wagelmans. 1998. “An Algorithm for Single-item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs.” Management Science 44 (6):831–838.
37. M.Steinrücke, 2015. “Integrated Production, Distribution and Scheduling in the Aluminium Industry:A Continuous-time MILP Model and Decomposition Method.” International Journal of Production Research 53 (19):5912–5930.
38. H.M.Wagner, and T.M.Whitin. 1958. “Dynamic Version of the Economic Lot Size Model.” Management Science 5 (1):89–96.