Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs

DOI10.1057/PALGRAVE.JORS.2602072zbMath1171.90333OpenAlexW2144526341MaRDI QIDQ3182664

Aaron Luntala Nsakanda, Moustapha Diaby

Publication date: 15 October 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602072

zbMATH Keywords

dynamic programminglarge-scale optimizationLagrangean relaxationcellular manufacturing systems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (2)

The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research ⋮ Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach

This page was built for publication: Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs