|
|||||
|
|
Capacitated dynamic lot-sizing problem with delivery/production time windows |
|
| Authors: | H-C Hwang S Çetinkaya |
| Institution: | a Department of Industrial Engineering, Chosun University, 375 Seosuk-Dong, Dong-Gu, Gwangju 501-759, South Korea b Sasin Graduate Institute of Business Administration of Chulalongkorn University, Phyathai Road, Pathumwan, Bangkok 10330, Thailand c Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX 77843, United States d Department of Industrial Engineering and Logistics Management, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong |
| Abstract: | In this paper we generalize the classical dynamic lot-sizing problem by considering production capacity constraints as well as delivery and/or production time windows. Utilizing an untraditional decomposition principle, we develop a polynomial-time algorithm for computing an optimal solution for the problem under the assumption of non-speculative costs. The proposed solution methodology is based on a dynamic programming algorithm that runs in O(nT4) time, where n is the number of demands and T is the length of the planning horizon. |
| Keywords: | Dynamic lot-sizing model Demand time window Capacitated production model |
| 本文献已被 ScienceDirect 等数据库收录！ | |