A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling |
| |
Authors: | Mohammad Ranjbar Bert De Reyck Fereydoon Kianfar |
| |
Institution: | 1. Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University of Mashad, Mashad, Iran;2. Department of Management Science and Innovation, University College London, Gower Street, London WC1E 6BT, UK;3. Department of Management Science and Operations, London Business School, Regent’s Park, London NW1 4SA, UK;4. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran |
| |
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 |
本文献已被 ScienceDirect 等数据库收录! |
|