Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Authors:
Hartmut Stadtler
Affiliations:
-
Venue:
Operations Research
Year:
2003

Citing 0
Cited 19

Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Computers and Operations Research
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics
Lot sizing and furnace scheduling in small foundries

Computers and Operations Research
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
A new heuristic method for capacitated multi-level lotsizing problem with backlogging

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Stochastic lot-sizing with backlogging: computational complexity analysis

Journal of Global Optimization
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

Computers and Operations Research
MIP formulations and heuristics for two-level production-transportation problems

Computers and Operations Research
Integrated pulp and paper mill planning and scheduling

Computers and Industrial Engineering
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times

Journal of Global Optimization
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands

Operations Research
A computational analysis of lower bounds for big bucket production planning problems

Computational Optimization and Applications
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

Computers and Operations Research
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders

Computers and Operations Research
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems
A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem

Proceedings of the 28th Annual ACM Symposium on Applied Computing
A hybrid cGA applied to the MLCLSP with overtime

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new time-oriented decomposition heuristic is proposed to solve the dynamic multi-item multilevel lot-sizing problem in general product structures with single and multiple constrained resources as well as setup times. While lot-sizing decisions are made sequentially within an internally rolling planning interval (or lot-sizing window), capacities are always considered over the entire planning horizon. For each submodel a model formulation based on the "Simple Plant Location" representation is developed. These mixed-integer linear submodels are solved by standard mathematical programming software even for relatively large test instances. Extensive computational tests show that the heuristic proposed provides a better solution quality than a well-known special purpose heuristic.