We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times.
- Authors
Cattrysse, Dirk; Salomon, Marc; Kuik, Roelof; van Wassenhove, Luk N.
- Abstract
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. The objective is to find a minimal cost production schedule such that dynamic demand is fulfilled without backlogging. DLSP is formulated as a Set Partitioning Problem (SPP). We present a dual ascent and column generation heuristic to solve SPP. The quality of the solutions can be measured, since the heuristic generates lower and upper bounds. Computational results on a personal computer show that the heuristic is rather effective, both in terms of quality of the solutions as well as in terms of required memory and computation time.
- Subjects
PRODUCTION engineering; HEURISTIC programming; OPERATIONS research; INDUSTRIAL engineering; HEURISTIC; ECONOMIC lot size; EQUIVALENCE relations (Set theory); SET theory; INDUSTRIAL efficiency; MATHEMATICAL models
- Publication
Management Science, 1993, Vol 39, Issue 4, p477
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.39.4.477