Premium
Local search methods for the discrete time/resource trade‐off problem in project networks
Author(s) -
De Reyck Bert,
Demeulemeester Erik,
Herroelen Willy
Publication year - 1998
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199809)45:6<553::aid-nav2>3.0.co;2-1
Subject(s) - tabu search , computer science , duration (music) , resource (disambiguation) , job shop scheduling , mathematical optimization , operations research , scheduling (production processes) , decomposition , mathematics , routing (electronic design automation) , computer network , algorithm , art , ecology , literature , biology
In this paper we consider the discrete time/resource trade‐off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade‐off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource‐constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998