(A) search procedure for resource constrained project scheduling problems자원 제약이 있는 프로젝트 일정 계획에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 433
  • Download : 0
In this thesis, we develop a new search procedure based on priority rule for the resource constrained project scheduling problem with the objective of minimizing makespan. In the search procedure, a solution is represented with a string of integers called priority list, each of which denotes priority of each activity. In our algorithm, the priority scheduling method is used for making a complete schedule from a given priority list. A simulated annealing algorithm is applied to find a priority list which gives a good project schedule. Unlike most of search methods, in our algorithm some activities are delayed on purpose so as to extend solution space, which gives a higher possibility of improving solution since non-delay schedules are not dominant in the problem. Our search algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and complex constraints. The performance of search heuristic is compared with existing heuristics on test problems presented by Patterson and randomly generated problems. Computational results showed that our heuristic outperformed existing algorithms.
Advisors
Kim, Yeong-Daeresearcher김영대researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1996
Identifier
105304/325007 / 000943533
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1996.2, [ ii, 39 p. ]

Keywords

Delay Schedule; Priority; Resource Constraints; Project scheduling; Simulated Annealing; 시뮬레이티드 어닐링; 지연 스케줄; 가중치; 자원 제약; 프로젝트 일정

URI
http://hdl.handle.net/10203/41479
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105304&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0