Search heuristics for resource constrained project scheduling

Cited 104 time in webofscience Cited 0 time in scopus
  • Hit : 697
  • Download : 21
DC FieldValueLanguage
dc.contributor.authorLee, Jae-Kwanko
dc.contributor.authorKim, Yeong-Daeko
dc.date.accessioned2008-10-09T12:48:21Z-
dc.date.available2008-10-09T12:48:21Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1996-05-
dc.identifier.citationJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.47, no.5, pp.678 - 689-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10203/7609-
dc.description.abstractWe develop a search procedure for project scheduling problems with multiple resource constraints as well as precedence constraints. The procedure is applied to three popular search heuristics, simulated annealing, tabu search and genetic algorithms. In the heuristics, a solution is represented with a string of numbers each of which denotes priority of each activity. The priorities are used to select an activity for scheduling among competing ones. The search heuristics with this encoding method can always generate feasible neighbourhood solutions for a given solution. Moreover, this encoding method is very flexible in that problems with objective functions of a general functional form (such as a nonlinear function) and complex constraints can be considered without much difficulty. Results of computational tests on the performance of the search heuristics showed that the search heuristics, especially the simulated annealing and tabu search algorithms worked better than existing heuristics.-
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherSTOCKTON PRESS-
dc.subjectTABU SEARCH-
dc.subjectOPTIMIZATION-
dc.subjectALGORITHM-
dc.subjectSYSTEMS-
dc.subjectBRANCH-
dc.titleSearch heuristics for resource constrained project scheduling-
dc.typeArticle-
dc.identifier.wosidA1996UH53100007-
dc.identifier.scopusid2-s2.0-0030151930-
dc.type.rimsART-
dc.citation.volume47-
dc.citation.issue5-
dc.citation.beginningpage678-
dc.citation.endingpage689-
dc.citation.publicationnameJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.nonIdAuthorLee, Jae-Kwan-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorheuristics-
dc.subject.keywordAuthorproject management-
dc.subject.keywordAuthorsearch-
dc.subject.keywordPlusTABU SEARCH-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusSYSTEMS-
dc.subject.keywordPlusBRANCH-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 104 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0