DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Sung-Joo | - |
dc.contributor.advisor | Lee, Jae-Kyu | - |
dc.contributor.advisor | 박성주 | - |
dc.contributor.advisor | 이재규 | - |
dc.contributor.author | Hong, Joon-Seok | - |
dc.contributor.author | 홍준석 | - |
dc.date.accessioned | 2011-12-14T06:05:26Z | - |
dc.date.available | 2011-12-14T06:05:26Z | - |
dc.date.issued | 1991 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=68024&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/44915 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 경영과학과, 1991.2, [ [iii], 35 p. ] | - |
dc.description.abstract | Production manufacturing scheduling problem has been the center of interest for the last decades. As all production systems are integrated into a scheme, the supply of raw material becomes a principle problem in production management system. This problem is more critical in petroleum industry because crude oil has various characteristics and the final product are changed according to crude oil supplied. Petroleum industry consists of a serious of related areas such of oil production, delivery of crude oils, refining operation, and marketing of refined products. Production planning determines aggregated production quantity for each final product while satisfying various firm``s constraints. Production planning is supported by a NLP system called RPMS(Refinery Petrochemical Modeling System). Crude oil daily delivery scheduling problem is tried to solve under the assumption that the monthly total charging quantity of each crude oil is given by the master production plan. In this study, a compound backtrack search algorithm using the existing AI search and intelligent backtracking technique is presented. This heuristic algorithm solved the problem in each subproblems. In advance, the combinations of crude oils that can be delivered simultaneously are composed in order to backtrack at deadend situation easily. The backjumping technique is used for the backtracking and minimizes the occurrence of deadend on the daily delivery scheduling. The quantity of each crude oil at purchasing time is determined at the last subproblem finally. The prototype of crude oil delivery scheduling algorithm is developed and tested. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Compound backtrack search algorithm for crude oil delivery scheduling problem | - |
dc.title.alternative | 原油導入 日程計劃 問題를 위한 휴리스틱 알고리즘의 開發에 관한 硏究 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 68024/325007 | - |
dc.description.department | 한국과학기술원 : 경영과학과, | - |
dc.identifier.uid | 000891548 | - |
dc.contributor.localauthor | Park, Sung-Joo | - |
dc.contributor.localauthor | Lee, Jae-Kyu | - |
dc.contributor.localauthor | 박성주 | - |
dc.contributor.localauthor | 이재규 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.