A study on the performance of differential search algorithm for single mode resource constrained project scheduling problem

Nazanin Rahmani,Vahid Zeighami,Reza Akbari

doi:10.5267/j.dsl.2015.5.005

Nazanin Rahmani, Vahid Zeighami + Show 1 more

Open Access

https://doi.org/10.5267/j.dsl.2015.5.005

Copy DOI

Journal: Decision Science Letters	Publication Date: Jan 1, 2015
Citations: 23	License type: cc-by

Abstract

Article history: Received March 29, 2015 Received in revised format: May 12, 2015 Accepted May 12, 2015 Available online May 18 2015 Differential Search (DS) algorithm is a new meta-heuristic for solving real-valued numerical optimization. This paper introduces a new method based on DS for solving Resource Constrained Project Scheduling Problem (RCPSP). The RCPSP is aimed to schedule a set of activities at minimal duration subject to precedence constraints and the limited availability of resources. The proposed method is applied to PSPLIB case studies and its performance is evaluated in comparison with some of state of art methods. Experimental results show that the proposed method is effective. Also, it is among the best algorithms for solving RCPSP. Growing Science Ltd. All rights reserved. 5 © 201

Highlights

The resource constrained project scheduling problem (RCPSP) is an important problem in project management, manufacturing and resource optimization
This paper introduces a new method based on Differential Search (DS) for solving Resource Constrained Project Scheduling Problem (RCPSP)
Differential Search Algorithm which is one of the most recently introduced methods of this type which was originally proposed for solving real-valued numerical optimization problems

Summary

Introduction

The resource constrained project scheduling problem (RCPSP) is an important problem in project management, manufacturing and resource optimization. RCPSP can be separated in different classes such as single mode RCPSP and multi-mode RCPSP with non-regular objective functions, stochastic RCPSP, bin-packing-related RCPSP problems, and multi resource constrained project scheduling problem. In single mode RCPSP, a project consisting of a set of activities with fixed durations and resource requirements is considered (Zeighami et al, 2013). In multi-mode RCPSP, each activity can be executed under different durations with renewable and non-renewable resources (Coelho & Vanhoucke, 2011). In multi-resource-constrained project scheduling problems, a job may require a set of operations, or a set of successive resources (Kumar, 2014)

Objectives

Methods

Conclusion