An Efficient Algorithm for Multi-Item Scheduling
From MaRDI portal
Cited in
(52)- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Vehicle routing via column generation
- A heuristic for multiple choice programming
- On upper bounds of sequential stochastic production planning problems
- A simulation study of hierarchical production-inventory control
- Primal-dual approach to the single level capacitated lot-sizing problem
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Comparisons of practical hierarchical control methods for interconnected dynamical systems
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- A new heuristic approach for the multi-item dynamic lot sizing problem
- CMIT, capacitated multi-level implosion tool
- The general lotsizing and scheduling problem
- Solving mixed integer programming production planning problems with setups by shadow price information.
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- An experimental analysis of solution performance in a resource sharing and scheduling problem
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Schumann, a modeling framework for supply chain management under uncertainty
- Facets and algorithms for capacitated lot sizing
- Heuristic methods and applications: A categorized survey
- Aggregate production planning for process industries under oligopolistic competition
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Integrated versus hierarchical approach to aggregate production planning and master production scheduling
- Scheduling the replenishment of just-in-time supermarkets in assembly plants
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Aggregate production planning for a continuous reconfigurable manufacturing process
- An approach for integrated scheduling and lot-sizing
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- A cyclical scheduling heuristic for lot sizing with capacity constraints
- Hybrid methods for lot sizing on parallel machines
- An ideal column algorithm for integer programs with special ordered sets of variables
- Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions
- A framework for modelling setup carryover in the capacitated lot sizing problem
- An integrated model for inventory and production planning in a two-stage hybrid production system
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Modeling industrial lot sizing problems: a review
- Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment
- The discrete lot-sizing and scheduling problem
- A Benders decomposition based heuristic for the hierarchical production planning problem
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- Heuristic algorithm for lot sizing and scheduling on identical parallel machines
- On discrete lot-sizing and scheduling on identical parallel machines
- Combining relax-and-fix and fix-and-optimize approaches to solve the multi-item capacitated lot-sizing problem with unrelated parallel machines
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
This page was built for publication: An Efficient Algorithm for Multi-Item Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5630826)
