An Efficient Algorithm for Multi-Item Scheduling
From MaRDI portal
Publication:5630826
DOI10.1287/OPRE.19.4.946zbMath0224.90039OpenAlexW2082601865MaRDI QIDQ5630826
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.19.4.946
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (50)
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 ⋮ A new heuristic approach for the multi-item dynamic lot sizing problem ⋮ CMIT, capacitated multi-level implosion tool ⋮ A heuristic for multiple choice programming ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ On upper bounds of sequential stochastic production planning problems ⋮ Hybrid methods for lot sizing on parallel machines ⋮ The general lotsizing and scheduling problem ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ A simulation study of hierarchical production-inventory control ⋮ Solving mixed integer programming production planning problems with setups by shadow price information. ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ 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 ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Set partitioning and column generation heuristics for capacitated dynamic lotsizing ⋮ Modeling industrial lot sizing problems: a review ⋮ Primal-dual approach to the single level capacitated lot-sizing problem ⋮ Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Capacitated lot-sizing and scheduling by Lagrangean relaxation ⋮ On discrete lot-sizing and scheduling on identical parallel machines ⋮ Aggregate production planning for process industries under oligopolistic competition ⋮ A cyclical scheduling heuristic for lot sizing with capacity constraints ⋮ Aggregate production planning for a continuous reconfigurable manufacturing process ⋮ A framework for modelling setup carryover in the capacitated lot sizing problem ⋮ An approach for integrated scheduling and lot-sizing ⋮ Comparisons of practical hierarchical control methods for interconnected dynamical systems ⋮ 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 ⋮ The discrete lot-sizing and scheduling problem ⋮ A Benders decomposition based heuristic for the hierarchical production planning problem ⋮ An integrated model for inventory and production planning in a two-stage hybrid production system ⋮ Schumann, a modeling framework for supply chain management under uncertainty ⋮ An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem ⋮ Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment ⋮ Facets and algorithms for capacitated lot sizing ⋮ Heuristic methods and applications: A categorized survey ⋮ Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems ⋮ A note on modeling multiple choice requirements for simple mixed integer programming solvers ⋮ The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability ⋮ GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem ⋮ An ideal column algorithm for integer programs with special ordered sets of variables ⋮ Vehicle routing via column generation ⋮ Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions ⋮ The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
This page was built for publication: An Efficient Algorithm for Multi-Item Scheduling
