Search algorithms for resource constrained project scheduling problem = 자원 제약이 있는 프로젝트 스케줄링에 대한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 238
  • Download : 0
We consider a project scheduling problem with multiple resource constraints as well as precedence constraints. For this problem, we apply and compare three popular search methods - Genetic Algorithm (GA), Simulated annealing (SA) and Tabu Search (TS), which have been used for various combinatorial optimization problems. We develop an encoding scheme in which a solution is represented with a string of numbers. Each number of the string denotes priority of each activity. The priority is used to select an activity among competing ones for resource allocation. This encoding method is very flexible, in the sense that problems with objective functions of a general functional form (such as a nonlinear function) and complex constraints from real world can be considered with much difficulty since it does not depend on the network topology. Furthermore, our procedure can be used in project scheduling problems with multiple projects. To evaluate the performance of our procedure, a series of computational test was done on randomly generated problems. The test shows that our procedure outperforms other existing heuristic methods - the minimum slack method, the iterative technique, the SEARCH heuristic.
Advisors
Kim, Yeong-Daeresearcher김영대researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1995
Identifier
98779/325007 / 000933385
Language
eng
Description

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

URI
http://hdl.handle.net/10203/41456
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=98779&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