A price-directed decomposition approach for solving large-scale capacitated part-routing problems
From MaRDI portal
Publication:3163241
DOI10.1080/00207540802680526zbMath1197.90161OpenAlexW2056880929MaRDI QIDQ3163241
Aaron Luntala Nsakanda, Moustapha Diaby, Wilson L. Price
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802680526
manufacturing systemsDantzig-Wolfe decompositionlarge-scale optimisationmultiple process plansmultiple routing
Cites Work
- Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings
- Selection of parts and machines for cellularization: A mathematical programming approach
- On cell size and machine requirements planning in group technology systems
- An integrated formulation of manufacturing cell formation with capacity planning and multiple routings
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- Efficient algorithm for cell formation with sequence data, machine replications and alternative process routings
- Production Planning by Mixed Integer Programming
This page was built for publication: A price-directed decomposition approach for solving large-scale capacitated part-routing problems