A framework for modelling setup carryover in the capacitated lot sizing problem
Authors:
- 1 July 1995
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (7) , 1973-1988
Abstract
This paper addresses the single-level capacitated lot sizing problem (CLSP) with setup carryover. Specifically, we consider a class of production planning problems in which multiple products can be produced within a time period and significant setup times are incurred when changing from one product to another. Hence, there might be instances where developing a feasible schedule becomes possible only if setups are carried over from one period to another. We develop a modelling framework to formulate the CLSP with setup times and setup carryovers. We then extend the modelling framework to include multiple machines and tool requirements planning. The need for such a model that integrates both planning and lot sizing decisions is motivated by the existence of a similar problem in a paper mill. We apply the modelling framework to solve optimally, an instance of the paper mill's problem.Keywords
This publication has 16 references indexed in Scilit:
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup TimesManagement Science, 1993
- Facets and algorithms for capacitated lot sizingMathematical Programming, 1989
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling ProblemOperations Research, 1988
- OR Practice—Determining Lot Sizes and Resource Requirements: A ReviewOperations Research, 1987
- A lot sizing and sequencing algorithm for dynamic demands upon a single facilityJournal of Operations Management, 1982
- A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problemJournal of Operations Management, 1981
- A Dynamic Lot Sizing Algorithm with Capacity ConstraintsA I I E Transactions, 1975
- An Efficient Algorithm for Multi-Item SchedulingOperations Research, 1971
- Minimum Change-Over Scheduling of Several Products on One MachineOperations Research, 1968
- Optimal Programming of Lot Sizes, Inventory and Labor AllocationsManagement Science, 1965