Publication Type

Journal Article

Version

publishedVersion

Publication Date

2-2009

Abstract

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as a solution combination method. Computational results on randomly generated problem sets are compared with the best available results indicating the efficiency of the proposed algorithm.

Keywords

Project scheduling, Heuristic, Scatter search, Path relinking, Time/resource trade-offs

Discipline

Business Administration, Management, and Operations | Theory and Algorithms

Research Areas

Operations Management

Publication

European Journal of Operational Research

Volume

193

Issue

1

First Page

35

Last Page

48

ISSN

0377-2217

Identifier

10.1016/j.ejor.2007.10.042

Publisher

Elsevier: 24 months

Embargo Period

8-29-2021

Download

Share

COinS