DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Sung-Soo | - |
dc.contributor.advisor | 박성수 | - |
dc.contributor.author | Jung, Ji-Young | - |
dc.contributor.author | 정지영 | - |
dc.date.accessioned | 2011-12-14T04:08:11Z | - |
dc.date.available | 2011-12-14T04:08:11Z | - |
dc.date.issued | 2006 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=255401&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40749 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 2006.2, [ ii, 48 p. ] | - |
dc.description.abstract | In this research, the single machine capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (CLSPSD) is considered. This problem is an extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption of sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs while satisfying the customer demands. It is known that CLSPSD is NP-hard. In this paper, a MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of CLPEX. Computational results show that the approach generates optimal or near optimal solutions. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | sequence-dependent setup costs and setup times | - |
dc.subject | lot-sizing | - |
dc.subject | simulated annealing algorithm | - |
dc.subject | 시뮬레이티드 어닐링 | - |
dc.subject | 순서에 종속된 준비시간과 준비 비용 | - |
dc.subject | 로트사이징 | - |
dc.title | (A) simulated annealing algorithm for the capacitated lot-sizing and scheduling problem under sequence-dependent setup costs and setup times | - |
dc.title.alternative | 순서에 종속된 준비 시간과 준비 비용을 고려한 로트사이징 문제의 시뮬레이티드 어닐링 해법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 255401/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 020043555 | - |
dc.contributor.localauthor | Park, Sung-Soo | - |
dc.contributor.localauthor | 박성수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.