A hybrid scatter search approach for resource-constrained project scheduling problem in PERT-type networks

Authors:
Siamak Baradaran;S. M. T. Fatemi Ghomi;Mahdi Mobini;S. S. Hashemin
Affiliations:
Department of Industrial Engineering, Islamic Azad University, Damavand Branch, Damavand, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Industrial Engineering Group, Faculty of Forestry, University of British Columbia, 2424 Main Mall, Vancouver, Canada V6T 1Z4;Department of Industrial Engineering, Islamic Azad University, Ardabil Branch, Ardabil, Iran
Venue:
Advances in Engineering Software
Year:
2010

Citing 4
Cited 2

Minimizing resource availability costs in time-limited project networks

Management Science
Resource-constrained project scheduling: a survey of recent developments

Computers and Operations Research
Efficient Monte Carlo simulation method of GERT-type network for project management

Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Robust optimization models for project scheduling with resource availability cost

Journal of Scheduling

Multi-mode renewable resource-constrained allocation in PERT networks

Applied Soft Computing
A hybrid genetic algorithm and fuzzy set applied to multi-mode resource-constrained project scheduling problem

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a metaheuristic algorithm for resource-constrained project scheduling problem (RCPSP) in PERT networks. A PERT-type project, where activities require resources of various types with random duration, is considered. The problem is to minimize the regular criterion namely project's makespan. The resource project scheduling model is an NP-hard, therefore to obtain a precise solution, a metaheuristic algorithm is suggested namely hybrid scatter search (HSS). The path relinking algorithm and two operators like crossover and prominent permutation-based are applied to solve the problem. The problem has to be solved at each decision point, when at least more than one activity is ready to be operated but the available amount of resources is limited. The metaheuristic model is illustrated by a numerical example. In order to validate the performance of new hybrid metaheuristic algorithm, solutions are compared with ''optimal solution'' for small networks. Also the efficiency of the proposed algorithm, for real world problems, in terms of solution quality, is compared with well-reported benchmark test problems available on the PSPLIB. The computational results reveal that the proposed algorithm has appropriate results for small networks and real world problems.