Abstract
One of the most important tasks operations manager are confronted with is to determine production quantities over a medium-size planning horizon such that demand is met, scarce production facilities are not overloaded and that the sum of holding and setup costs is minimized. For the single machine case the well-known Capacitated Lot-Sizing Problem (CLSP) has been proposed to determine minimum cost solutions. The CLSP is based on the assumption that for each lot produced in a period setup cost is incurred. But in practice the machine setup can be preserved over idle time very often. In such cases the setup cost of a CLSP solution can be reduced by linking the production quantities of an item which is scheduled in two adjacent periods. Therefore we propose the CLSP with linked lot-sizes of adjacent periods. The problem is formulated as a mixed-integer programming model. For the heuristic solution we present a priority rule based scheduling procedure which is backward-oriented, i.e. at first lot-sizes are fixed in the last period, then in the last but one period, and so on. The priority rule consists of a convex combination of estimated holding and setup cost savings. Since the solution quality depends on realisation of the convex combination we perform a simple local search method on the parameter space to obtain low cost solutions. We show by a computational study that our procedure is more efficient than a two stage approach which first solves the CLSP with the Dixon-Silver or the Kirca-Kökten heuristic and performs linking of lots afterwards.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barany, I., van Roy, T.J., and Wolsey, L.A. (1984), Strong Formulations for Multi—Item Capacitated Lot—Sizing, Management Science, Vol. 30, pp. 1255–1261
Cattrysse, D., Maes, J., and Van Wassenhove, L.N. (1990), Set Partitioning and Column Generation Heuristics for Capacitated Lotsizing, European Journal of Operational Research, Vol. 46, pp. 38–47
Diaby, M., Bahl, H.C., Karwan, M.H., and Zionts, S. (1992), A Lagrangean Relaxation Approach for VeryLarge-Scale Capacitated Lot-Sizing, Management Science, Vol. 38, pp. 1329–1340
Dillenberger, C., Escudero, L.F., Wollensak, A., and Zhang, W. (1992), On Solving a Large-Scale Resource Allocation Problem in Production Planning, in: Operation Research in Production Planning and Control, FAN-DEL, G. et al. (eds.), Berlin, Springer, pp. 105–119
Dixon, P. S. and Silver, E.A. (1981), A Heuristic Solution Procedure for Multi-Item Single-Level, Limited Capacity, Lot-Sizing Problem, Journal of Operations Management, Vol. 2 /1, pp. 23–39
Dogramaci, A., Panayiotopoulos, J.C., and Adam, N.R. (1981), The Dynamic Lot-Sizing Problem for Multiple Items under Limited Capacity, AILE Transactions, Vol. 13, pp. 294–303
Gelders, L.F., Maes, J., and Van Wassenhove, L.N. (1986), A Branch and Bound Algorithm for the Multi-Item Single Level Capacitated Dynamic Lot-Sizing Problem, in: Multi-stage Production Planning and Inventory Control, Axsäter, S. et al. (eds.), Berlin, Springer, pp. 92–108
Günther, H.O. (1987), Planning Lot Sizes and Capacity Requirements in a Single Stage Production System, European Journal of Operational Research, Vol. 31, pp. 223–231
Haase, K. (1994), Lotsizing and Scheduling for Production Planning, Berlin, Springer
Haase, K. (1996), Capacitated lot-sizing with sequence dependent setup costs, OR Spektrum, Vol. 18, pp. 51–59
Haase, K., Drexl, A. (1994), Capacitated Lot-Sizing with Linked Production Quantities of Adjacent Periods, in: Operations Research 83, Bachem, A. et al. (eds.), pp. 212–215
Haase, K. and Latteier, J. (1997), Deckungsbeitrags-orientierte Lehrgangsplanung bei der Lufthansa Technical Training GmbH, OR Spektrum, to appear
Kirca, O. and Kökten, M. (1994), A New Heuristic Approach for the Multi—Item Dynamic Lot Sizing Problem, European Journal of Operational Research, Vol. 75, pp. 332341
Kohlmorgen, U., Schmeck, H. and Haase, K. (1996), Experiences with Fine-Grained Parallel Genetic Algorithms, Annals of OR, to appear
Lambrecht, M.R. and Vanderveken, H. (1979), Heuristic Procedures for the Single Operations, Multi—Item Loading Problem, AILE Transactions, Vol. 11, pp. 319–326
Maes, J. and Van Wassenhove, L.N. (1986), A Simple Heuristic for the Multi—Item Single Level Capacitated Lotsizing Problem, Operations Research Letters, Vol. 4, pp. 265–274
Schrage, L. (1986), Linear, Integer and Quadratic Programming with LINDO,Redwood City
Thizy, J.M. and Van Wassenhove, L.N. (1985), Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation, IIE Transactions, Vol. 17, pp. 308–313
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Haase, K. (1998). Capacitated Lot-Sizing with Linked Production Quantities of Adjacent Periods. In: Drexl, A., Kimms, A. (eds) Beyond Manufacturing Resource Planning (MRP II). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03742-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-03742-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08393-8
Online ISBN: 978-3-662-03742-3
eBook Packages: Springer Book Archive