A polynomial algorithm for a lot sizing problem with backlogging, outsourcing models and limited inventory

Chengbin Chu 1, 2 Feng Chu 3 Jinhong Zhong 4 Shanlin Yang 4
1 LGI - Laboratoire Génie Industriel - EA 2606
2 School of Economics and Management
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
4 School of Management
Abstract : This paper addresses a real-life production planning problem arising in a manufacturer of luxury goods. This problem can be modeled as a single item dynamic lot-sizing model with backlogging, outsourcing and inventory capacity. Setup cost is included in the production cost function, and the production level at each period is unbounded. The holding, backlogging and outsourcing cost functions are assumed to be linear. The backlogging level at each period is also limited. The goal is to satisfy all demands in the planning horizon at minimal total cost. We show that this problem can be solved in O(T4 log T) time where T is the number of periods in the planning horizon.
Keywords : Polynomial algorithm Dynamic programming Lot-sizing Production planning
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-00735580
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, September 26, 2012 - 9:53:21 AM
Last modification on : Wednesday, January 22, 2020 - 11:36:40 AM

Identifiers

Collections

UNIV-EVRY | IBISC-AROBAS | IBISC | CENTRALESUPELEC | LGI | LGI-MO

Citation

Chengbin Chu, Feng Chu, Jinhong Zhong, Shanlin Yang. A polynomial algorithm for a lot sizing problem with backlogging, outsourcing models and limited inventory. Computers and Industrial Engineering, Elsevier, 2013, 64 (1), pp.200--210. ⟨10.1016/j.cie.2012.08.007⟩. ⟨hal-00735580⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

147

Contact

Informations

CCSD