DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | No, Hyo-Sang | - |
dc.contributor.author | 노효상 | - |
dc.date.accessioned | 2011-12-14T04:17:26Z | - |
dc.date.available | 2011-12-14T04:17:26Z | - |
dc.date.issued | 1991 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67899&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41359 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1991.2, [ [ii], 44 p. ] | - |
dc.description.abstract | In this thesis, a two-machine flow-shop scheduling problem with two kinds(renewable and non-renewable) of additional resources is considered. The objective of the problem is to determine the sequence of jobs on each machine and the amount of resources to be allotted for each operation in order to minimize the makespan. It is assumed that the processing time of each operation is a linearly decreasing function about allotted amounts of renewable and non-renewable resources. And the amount of each type of resource is restricted to an upper limit. Some dominance properties are characterized for the our problem, based upon which a branch and bound algorithm is exploited to find the optimum. Heuristic algorithms are also proposed and some computational experiences are discussed. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | (A) two-machine flow-shop scheduling problem with two renewable and non-renewable resources | - |
dc.title.alternative | 반복사용자원과 소모자원을 소요하는 두 기계에서의 규칙적 연속공정작업들의 일정계획 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 67899/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000891136 | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.