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

• Main Authors: RANBAR, Mohammad, DE REYCK, Bert, KIANFAR, Fereydoon
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2009
• Subjects: Project scheduling; Heuristic; Scatter search; Path relinking; Time/resource trade-offs; Business Administration, Management, and Operations; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/lkcsb_research/6754; https://ink.library.smu.edu.sg/context/lkcsb_research/article/7751/viewcontent/1_s2.0_S0377221707010661_main.pdf
• Institution: Singapore Management University

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.