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

Business Administration, Management, and Operations

Generalized precedence relations

Publication Year

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 Dec 1999

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 …


A Branch-And-Bound Procedure For The Resource-Constrained Project Scheduling Problem With Generalized Precedence Relations, Bert De Reyck, Willy Herroelen Nov 1998

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 …