Resource -constrained scheduling of linear projects: A heuristic approach using tabu search heuristics
Abstract
Resource scheduling has been a major concern for decades in construction projects. However, most of the researches have utilized the Critical Path Method, which is not suitably applied on linear construction projects. The findings from a literature review prove that little effort has been done in the area of resource allocation problems in linear scheduling. The development of new resource allocation tools in linear scheduling is presented in this study. The proposed research develops a new resource allocation mechanism for resource scheduling in linear scheduling. This new mechanism consists of two models. The first is a rule-of-thumb heuristic model, which is based on the least remaining float heuristic. The feasible solution obtained from the first model is used as the input of the second model, which is an optimization-based model called Heuristic Linear Scheduling (HLS). The HLS model optimizes linear schedules through Tabu Search algorithms. The computerized implementation of HLS is presented. Two construction projects are used to verify this new mechanism.
Degree
Ph.D.
Advisors
Halpin, Purdue University.
Subject Area
Civil engineering|Industrial engineering
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.