Open Access. Powered by Scholars. Published by Universities.®

Business Commons

Open Access. Powered by Scholars. Published by Universities.®

Research Collection Lee Kong Chian School Of Business

Physical Sciences and Mathematics

Scatter search

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Business

A Hybrid Scatter Search For The Discrete Time/Resource Trade-Off Problem In Project Scheduling, Mohammad Ranbar, Bert De Reyck, Fereydoon Kianfar Feb 2009

A Hybrid Scatter Search For The Discrete Time/Resource Trade-Off Problem In Project Scheduling, Mohammad Ranbar, Bert De Reyck, Fereydoon Kianfar

Research Collection Lee Kong Chian School Of Business

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 …


A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke Mar 2006

A Hybrid Scatter Search/Electromagnetism Meta-Heuristic For Project Scheduling, Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke

Research Collection Lee Kong Chian School Of Business

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational …