Please use this identifier to cite or link to this item:
|Title:||Single item lot-sizing problems with backlogging on a single machine at a finite production rate|
Finite production rate
|Citation:||Song, Y., Chan, G.H. (2005-02-16). Single item lot-sizing problems with backlogging on a single machine at a finite production rate. European Journal of Operational Research 161 (1) : 191-202. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2003.04.001|
|Abstract:||In this paper we consider a single item lot-sizing problem with backlogging on a single machine at a finite production rate. The objective is to minimize the total cost of setup, stockholding and backlogging to satisfy a sequence of discrete demands. Both varying demands over a finite planning horizon and fixed demands at regular intervals over an infinite planning horizon are considered. We have characterized the structure of an optimal production schedule for both cases. As a consequence of this characterization, a dynamic programming algorithm is proposed for the computation of an optimal production schedule for the varying demands case and a simpler one for the fixed demands case. © 2003 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 19, 2018
WEB OF SCIENCETM
checked on Jun 12, 2018
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.