Resource-constrained project scheduling problem with multiple execution modes and fuzzy/crisp activity durations

Authors:
Omer Atli;Cengiz Kahraman
Affiliations:
Aeronautics and Space Technologies Institute, Turkish Air Force Academy Yesilyurt, Bakirkoy, Istanbul, Turkey;Department of Industrial Engineering, Istanbul Technical University, Istanbul, Turkey
Venue:
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Year:
2014

Citing 8
Cited 0

Fuzzy project scheduling system for software development

Fuzzy Sets and Systems - Special issue on operations research
Fuzzy priority heuristics for project scheduling

Fuzzy Sets and Systems
Fuzzy Sets and Systems: Theory and Applications

Fuzzy Sets and Systems: Theory and Applications
Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization

Journal of Heuristics
A Method of Computation of Characteristics of Operations in a Problem of Fuzzy Network Planning and Management

Cybernetics and Systems Analysis
A multi-mode resource-constrained scheduling problem in the context of port operations

Computers and Industrial Engineering
A genetic algorithm approach to a general category projectscheduling problem

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
System design by constraint adaptation and differential evolution

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the fuzzy and crisp multi mode resource-constrained project scheduling problem F/C-MM-RCPSP with multiple execution modes for each activity. The objective function is the minimization of the project completion time. Heuristics based on Minslack priority rules are considered as initial solution procedures for this problem. Nevertheless, the NP-hard nature of the problem which is difficult to use to solve realistic sized projects makes necessary the use of heuristic and metaheuristics in practice. A global search metaheuristics taboo search algorithm TSA is proposed to solve this NP-hard problem. Two heuristic algorithms are developed to solve an F/C-MM-RCPSP. The first one is a minslack priority scheduling algorithm which includes a combination of an activity and a mode selection rule; the second one is a TSA. The solutions obtained by the former algorithm with the best activity and mode-priority rule combination are used as a baseline to compare those obtained by the latter. Finally, we present the results of our through computational study. A computational experiment is described, performed on a set of instances based on standard test problems from the PSPlib for the MM-RCPSPs. The algorithms are computationally compared, the results are analyzed and discussed and some conclusions are given.