Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Business
The Multi– Mode Resource– Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
The Multi– Mode Resource– Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
In this paper, we tackle the challenging problem of scheduling activities to minimize the project duration, in which the activities (a) are subject to generalized precedence relations, (b) require units of multiple renewable, non-renewable and doubly constrained resources for which a limited availability is imposed, and (c) can be performed in one of several different ways, reflected in multiple activity scenarios or modes. These multiple modes give rise to several kinds of tradeoffs (time/resource, time/cost and resource/resource trade-offs) which allow for a more effcient allocation and use of resources. We present a local search-based solution methodology which is able to …
Local Search Methods For The Discrete Time/Resource Trade-Off Problem In Project Networks, Bert De Reyck, Erik Demeulemeester, Willy Herroelen
Local Search Methods For The Discrete Time/Resource Trade-Off Problem In Project Networks, Bert De Reyck, Erik Demeulemeester, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
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 …