Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
From MaRDI portal
Publication:3087842
DOI10.1111/j.1475-3995.2010.00774.xzbMath1219.90062OpenAlexW2040240401MaRDI QIDQ3087842
Yuheng Cao, Aaron Luntala Nsakanda, Moustapha Diaby
Publication date: 17 August 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00774.x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bicriterion framework for operations assignment and routing flexibility analysis in cellular manufacturing systems
- 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
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Efficient algorithm for cell formation with sequence data, machine replications and alternative process routings
- Selected Topics in Column Generation