Timed route approaches for large multi-product multi-step capacitated production planning problems
From MaRDI portal
Publication:2116870
DOI10.1016/J.EJOR.2021.08.011zbMATH Open1495.90063OpenAlexW3194478874MaRDI QIDQ2116870FDOQ2116870
Authors: Sébastien Beraudy, Nabil Absi, Stèphane Dauzère-Pérès 
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.011
Recommendations
- Dynamic models of production with multiple operations and general processing times
- Manufacturing Planning Over Alternative Facilities: Modeling, Analysis and Algorithms
- Production Planning in Assembly Line Systems
- A polynomial algorithm for a multi-item capacitated production planning problem
- Routing flexibility and production scheduling in a flexible manufacturing system
Cites Work
- Branch-and-price: Column generation for solving huge integer programs
- A Primer in Column Generation
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Dynamic version of the economic lot size model
- Decomposition Principle for Linear Programs
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Integration of lotsizing and scheduling decisions in a job-shop
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches.
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Optimal wafer cutting in shuttle layout problems
- A Tactical Planning Model for a Job Shop
- Semiconductor lot allocation using robust optimization
- Order release planning by iterative simulation and linear programming: theoretical foundation and analysis of its shortcomings
Cited In (2)
This page was built for publication: Timed route approaches for large multi-product multi-step capacitated production planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116870)
