Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Business
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 …
A Branch-And-Bound Procedure For The Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
A Branch-And-Bound Procedure For The Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
We present an optimal solution procedure for the resource-constrained project scheduling problem (RCPSP) with generalized precedence relations (RCPSP-GPR) with the objective of minimizing the project makespan. The RCPSPGPR extends the RCPSP to arbitrary minimal and maximal time lags between the starting and completion times of activities. The proposed procedure is suited for solving a general class of project scheduling problems and allows for arbitrary precedence constraints, activity ready times and deadlines, multiple renewable resource constraints with time-varying resource requirements and availabilities, several types of permissible and mandatory activity overlaps and multiple projects. It can be extended to other regular and …
New Computational Results On The Discrete Time/Cost Trade-Off Problem In Project Networks, Erik Demeulemeester, Bert De Reyck, Bram Foubert, Willy Herroelen
New Computational Results On The Discrete Time/Cost Trade-Off Problem In Project Networks, Erik Demeulemeester, Bert De Reyck, Bram Foubert, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
We describe a new exact procedure for the discrete time/cost trade-off problem in deterministic activity-on-the-arc networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single resource (money) committed to it. The objective is to construct the complete and efficient time/cost profile over the set of feasible project durations. The procedure uses a horizon-varying approach based on the iterative optimal solution of the problem of minimising the sum of the resource use over all activities subject to the activity precedence constraints and a project deadline. This optimal solution is …
Resource-Constrained Project Scheduling: A Survey Of Recent Developments, Willy Herroelen, Bert De Reyck, Erik Demeulemeester
Resource-Constrained Project Scheduling: A Survey Of Recent Developments, Willy Herroelen, Bert De Reyck, Erik Demeulemeester
Research Collection Lee Kong Chian School Of Business
We review recent advances in dealing with the resource-constrained project scheduling problem using an efficient depth-first branch-and-bound procedure, elaborating on the branching scheme, bounding calculations and dominance rules, and discuss the potential of using truncated branch-and-bound. We derive conclusions from the research on optimal solution procedures for the basic problem and subsequently illustrate extensions to a rich and realistic variety of related problems involving activity preemption, the use of ready times and deadlines, variable resource requirements and availabilities, generalized precedence relations, time/cost, time/resource and resource/resource trade-offs and non-regular objective functions.
An Optimal Procedure For The Resource-Constrained Project Scheduling Problem With Discounted Cash Flows And Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
An Optimal Procedure For The Resource-Constrained Project Scheduling Problem With Discounted Cash Flows And Generalized Precedence Relations, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
In this paper, we consider the resource-constrained project scheduling problem (RCPSP) with discounted cash flows and generalized precedence relations (RCPSPDC-GPR). The RCPSPDC-GPR extends the RCPSP to (a) arbitrary minimal and maximal time lags between the starting and completion times of activities and (b) the non-regular objective function of maximizing the net present value of the project with positive and/or negative cash flows associated with the activities. To the best of our knowledge, the literature on the RCPSPDC-GPR is completely void. We present a depth-first branch-and-bound algorithm in which the nodes in the search tree represent the original project network extended …