An efficient procedure for dynamic lot-sizing model with demand time windows

Hark Chin Hwang

doi:10.1007/s10898-006-9033-0

An efficient procedure for dynamic lot-sizing model with demand time windows

Hark Chin Hwang

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T ³) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T², nT}) time complexity.

Original language	English
Pages (from-to)	11-26
Number of pages	16
Journal	Journal of Global Optimization
Volume	37
Issue number	1
DOIs	https://doi.org/10.1007/s10898-006-9033-0
Publication status	Published - Jan 2007

Bibliographical note

Funding Information:
Acknowledgements The author would like to thank the anonymous referees for their comments in improving the paper. He also really appreciates a thorough review from one of the referees despite many mistakes in the first version of the paper. This study was supported in part by research funds from Chosun University, 2006.

Keywords

Demand time window
Dynamic lot-sizing model
Dynamic programming
Non-speculative cost structure
Production

Access to Document

10.1007/s10898-006-9033-0

Cite this

@article{21164ab5cf3841c89d53e446eb3f0404,

title = "An efficient procedure for dynamic lot-sizing model with demand time windows",

abstract = "We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T 3) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max \{T2, nT\}) time complexity.",

keywords = "Demand time window, Dynamic lot-sizing model, Dynamic programming, Non-speculative cost structure, Production",

author = "Hwang, \{Hark Chin\}",

note = "Funding Information: Acknowledgements The author would like to thank the anonymous referees for their comments in improving the paper. He also really appreciates a thorough review from one of the referees despite many mistakes in the first version of the paper. This study was supported in part by research funds from Chosun University, 2006.",

year = "2007",

month = jan,

doi = "10.1007/s10898-006-9033-0",

language = "English",

volume = "37",

pages = "11--26",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - An efficient procedure for dynamic lot-sizing model with demand time windows

AU - Hwang, Hark Chin

N1 - Funding Information: Acknowledgements The author would like to thank the anonymous referees for their comments in improving the paper. He also really appreciates a thorough review from one of the referees despite many mistakes in the first version of the paper. This study was supported in part by research funds from Chosun University, 2006.

PY - 2007/1

Y1 - 2007/1

N2 - We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T 3) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T2, nT}) time complexity.

AB - We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T 3) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T2, nT}) time complexity.

KW - Demand time window

KW - Dynamic lot-sizing model

KW - Dynamic programming

KW - Non-speculative cost structure

KW - Production

UR - https://www.scopus.com/pages/publications/33845304679

U2 - 10.1007/s10898-006-9033-0

DO - 10.1007/s10898-006-9033-0

M3 - Article

AN - SCOPUS:33845304679

SN - 0925-5001

VL - 37

SP - 11

EP - 26

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 1

ER -

An efficient procedure for dynamic lot-sizing model with demand time windows

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this