A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling

Ranjbar, M ; Sharif University of Technology | 2009

767 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ejor.2007.10.042
  3. Publisher: 2009
  4. Abstract:
  5. 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. © 2007 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Heuristic ; Path relinking ; Project scheduling ; Scatter search ; Commerce ; Heuristic methods ; Learning algorithms ; Scheduling ; Combination methods ; Computational results ; Different modes ; Precedence constraints ; Project makespan ; Renewable resources ; Resource requirements ; Scatter search algorithms ; Time lags ; Time/resource trade-offs ; Heuristic programming
  8. Source: European Journal of Operational Research ; Volume 193, Issue 1 , 2009 , Pages 35-48 ; 03772217 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0377221707010661