Free Access
Issue
RAIRO-Oper. Res.
Volume 55, Number 3, May-June 2021
Page(s) 1197 - 1212
DOI https://doi.org/10.1051/ro/2021049
Published online 11 May 2021
  • Y. Adulyasak, J. Cordeau and R. Jans, The production routing problem: a review of formulations and solution algorithms. Comput. Oper. Res. 55 (2015) 141–152. [Google Scholar]
  • A. Azadeh, S. Elahi, M.H. Farahani and B. Nasirian, A genetic algorithm-taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput. Ind. Eng. 104 (2017) 124–133. [Google Scholar]
  • J.F. Bard and N. Nananukul, The integrated production-inventory-distribution-routing problem. J. Scheduling 12 (2009) 257–280. [Google Scholar]
  • N. Ben-Khedher and C.A. Yano, The multi-item joint replenishment problem with transportation and container effects. Transp. Sci. 28 (1994) 37–54. [Google Scholar]
  • F. Brandão and J.P. Pedroso, Bin packing and related problems: General arc-flow formulation with graph compression. Comput. Oper. Res. 69 (2016) 56–67. [Google Scholar]
  • L.C. Coelho, J. Cordeau and G. Laporte, Thirty years of inventory routing. Transp. Sci. 48 (2014) 1–19. [Google Scholar]
  • K. Copil, M. Wörbelauer, H. Meyr and H. Tempelmeier, Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectr. 39 (2017) 1–64. [Google Scholar]
  • E. Falkenauer, A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2 (1996) 5–30. [Google Scholar]
  • W.-S. Lee, J.-H. Hana and S.-H. Cho, A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem. Int. J. Prod. Econ. 98 (2005) 204–214. [Google Scholar]
  • M. Matsumoto and T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8 (1998) 3–30. [Google Scholar]
  • G.M. Melega, S.A. de Araujo and R. Jans, Classification and literature review of integrated lot-sizing and cutting stock problems. Eur. J. Oper. Res. 271 (2018) 1–19. [Google Scholar]
  • F. Molina, R. Morabito and S.A. de Araujo, MIP models for production lot sizing problems with distribution costs and cargo arrangement. J. Oper. Res. Soc. 67 (2016) 1395–1407. [Google Scholar]
  • L.V. Norden and S.L.V. d. Velde, Multi-product lot-sizing with a transportation capacity reservation contract. Eur. J. Oper. Res. 165 (2005) 127–138. [Google Scholar]
  • Y. Pochet, Mathematical programming models and formulations for deterministic production planning problems. Computational Combinatorial Optimization, edited by M. Junger and D. Naddef. In: Vol. 2241 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg (2001) 57–111. [Google Scholar]
  • E. Sancak and F.S. Salman, Multi-item dynamic lot-sizing with delayed transportation policy. Int. J. Prod. Econ. 131 (2011) 595–603. [Google Scholar]
  • V. Schmid, K.F. Doerner and G. Laporte, Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224 (2013) 435–448. [Google Scholar]
  • K.E. Stecke and X. Zhao, Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manuf. Serv. Oper. Manage. 9 (2007) 123–224. [Google Scholar]
  • P.H. Vance, C. Barnhart, E.L. Johnson and G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. App. 3 (1994) 111–130. [Google Scholar]
  • H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model. Manage. Sci. 5 (1958) 89–96. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.