Search for: project-makespan
0.005 seconds

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

    , Article European Journal of Operational Research ; Volume 193, Issue 1 , 2009 , Pages 35-48 ; 03772217 (ISSN) Ranjbar, M ; De Reyck, B ; Kianfar, F ; Sharif University of Technology
    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...