Universität zu Köln

Tempelmeier, Horst and Hilger, Timo (2015). Linear programming models for a stochastic dynamic capacitated lot sizing problem. Comput. Oper. Res., 59. S. 119 - 126. OXFORD: PERGAMON-ELSEVIER SCIENCE LTD. ISSN 1873-765X

Full text not available from this repository.

Abstract

In this paper the stochastic dynamic lot sizing problem with multiple items and limited capacity under two types of fill rate constraints is considered. It is assumed that according to the static-uncertainty strategy of Bookbinder and Tan [2], the production periods as well as the lot sizes are fixed in advance for the entire planning horizon and are executed regardless of the realisation of the demands. We propose linear programming models, where the non-linear functions of the expected backorders and the expected inventory on hand are approximated by piecewise linear functions. The resulting models are solved with a variant of the Fix-and-Optimize heuristic. The results are compared with those of the column generation heuristic proposed by Tempelmeier [14]. (C) 2015 Elsevier Ltd. All rights reserved.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Tempelmeier, Horst UNSPECIFIED UNSPECIFIED UNSPECIFIED Hilger, Timo UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-400797
DOI:	10.1016/j.cor.2015.01.007
Journal or Publication Title:	Comput. Oper. Res.
Volume:	59
Page Range:	S. 119 - 126
Date:	2015
Publisher:	PERGAMON-ELSEVIER SCIENCE LTD
Place of Publication:	OXFORD
ISSN:	1873-765X
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language FILL RATE; DEMAND Multiple languages Computer Science, Interdisciplinary Applications; Engineering, Industrial; Operations Research & Management Science Multiple languages
URI:	http://kups.ub.uni-koeln.de/id/eprint/40079