Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
- Authors
- Kim, Seong-in; Han, Junghee; Lee, Youngho; Park, Eunkyung
- Issue Date
- 2월-2010
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Keywords
- Production system; Lot-sizing and scheduling; Heuristic
- Citation
- COMPUTERS & OPERATIONS RESEARCH, v.37, no.2, pp.302 - 314
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTERS & OPERATIONS RESEARCH
- Volume
- 37
- Number
- 2
- Start Page
- 302
- End Page
- 314
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/117058
- DOI
- 10.1016/j.cor.2009.05.007
- ISSN
- 0305-0548
- Abstract
- In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-ove rand overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period in to a number of micro time periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically in tractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions with in acceptable time limit. (c) 2009 Elsevier Ltd. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.