Multi mode resource constrained project scheduling problems with solving Taboo search

Omer Atli, Cengiz Kahraman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity. The objective function is the minimization of the project completion time. Heuristics based on priority rule are considered as initial solution procedures for this problem. The proposed Taboo search algorithm (TSA) is computationally compared, the results are analyzed and discussed, and some conclusions are given. Results obtained on six classes of test problems and comparison with other algorithms from the literature show that our algorithm gives better solutions.

Original languageEnglish
Title of host publicationWorld Scientific Proc. Series on Computer Engineering and Information Science 7; Uncertainty Modeling in Knowledge Engineering and Decision Making - Proceedings of the 10th International FLINS Conf.
PublisherWorld Scientific Publishing Co. Pte Ltd
Pages448-453
Number of pages6
ISBN (Print)9789814417730
DOIs
Publication statusPublished - 2012
Event10th International Fuzzy Logic and Intelligent Technologies inNuclear Science Conference, FLINS 2012 - Istanbul, Turkey
Duration: 26 Aug 201229 Aug 2012

Publication series

NameWorld Scientific Proc. Series on Computer Engineering and Information Science 7; Uncertainty Modeling in Knowledge Engineering and Decision Making - Proceedings of the 10th International FLINS Conf.
Volume7

Conference

Conference10th International Fuzzy Logic and Intelligent Technologies inNuclear Science Conference, FLINS 2012
Country/TerritoryTurkey
CityIstanbul
Period26/08/1229/08/12

Fingerprint

Dive into the research topics of 'Multi mode resource constrained project scheduling problems with solving Taboo search'. Together they form a unique fingerprint.

Cite this