Time-cost trade-offs in resource-constraint project scheduling problems with overlapping modes

2014 ◽  
Vol 6 (3) ◽  
pp. 215 ◽  
Author(s):  
François Berthaut ◽  
Robert Pellerin ◽  
Nathalie Perrier ◽  
Adnène Hajji
Keyword(s):  
Project Scheduling ◽  
Resource Constraint ◽  
Time Cost ◽  
Scheduling Problems ◽  
Trade Offs

The Project Scheduling Game (PSG): Simulating Time/Cost Trade-Offs in Projects

2005 ◽  
Vol 36 (1) ◽  
pp. 51-59 ◽  
Author(s):  
Mario Vanhoucke ◽  
Ann Vereecke ◽  
Paul Gemmel
Keyword(s):  
Project Scheduling ◽  
Critical Path ◽  
Real Life ◽  
Network Activity ◽  
Simulation Game ◽  
Time Cost ◽  
Life Project ◽  
Trade Offs ◽  
Total Project Cost ◽  
Total Project

The Project Scheduling Game is an IT-supported simulation game that illustrates the complexity of scheduling a real-life project. The project is based on a sequence of activities for a large real-life project at the Vlaamse Maatschappij voor Watervoorziening, which aims at the expansion of the capacity to produce purified water. The basic problem type that we use in the game has been described in the literature as a CPM (critical path method) network problem, and focuses on the time/cost relationship in each activity of the project. Indeed, by allocating resources to a particular activity, the manager decides about the duration and corresponding cost of each network activity. The manager schedules the project with the negotiated project deadline in mind, focusing on the minimization of the total project cost.

scholarly journals A Float-Path Theory and Its Application to the Time-Cost Tradeoff Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-17 ◽  
Author(s):  
Zhi-xiong Su ◽  
Jian-xun Qi ◽  
Han-ying Wei
Keyword(s):  
Project Scheduling ◽  
Polynomial Algorithm ◽  
The Other ◽  
Time Cost ◽  
Scheduling Problems ◽  
Activity Networks ◽  
Path Lengths ◽  
Preprocessing Technique ◽  
Long Paths

Activity floats are vital for project scheduling, such as total floats which determine the maximum permissible delays of activities. Moreover, activity paths in activity networks present essences of many project scheduling problems; for example, the time-cost tradeoff is to shorten long paths at lower costs. We discovered relationships between activity floats and paths and established a float-path theory. The theory helps to compute path lengths using activity floats and analyze activity floats using paths, which helps to transmute a problem into the other simpler one. We discussed applications of the float-path theory and applied it to solve the time-cost tradeoff problem (TCTP), especially the nonlinear and discrete versions. We proposed a simplification from an angle of path as a preprocessing technique for the TCTP. The simplification is a difficult path problem, but we transformed it into a simple float problem using the float-path theory. We designed a polynomial algorithm for the simplification, and then the TCTP may be solved more efficiently.

Project Scheduling Problems: A Survey

1993 ◽  
Vol 13 (11) ◽  
pp. 80-91 ◽  
Author(s):  
Oya Icmeli ◽  
S. Selcuk Erenguc ◽  
Christopher J. Zappe
Keyword(s):  
Project Scheduling ◽  
Assembly Line ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Assembly Line Balancing ◽  
Scheduling Problem ◽  
Time Cost ◽  
Scheduling Problems ◽  
Project Scheduling Problem ◽  
Work Done

A survey of project scheduling problems since 1973 limited to work done specifically in the project scheduling area (although several techniques developed for assembly line balancing and job‐shop scheduling can be applicable to project scheduling): the survey includes the work done on fundamental problems such as the resource‐constrained project scheduling problem (RCPSP); time/cost trade‐off problem (TCTP); and payment scheduling problem (PSP). Also discusses some recent research that integrates RCPSP with either TCTP or PSP, and PSP with TCTP. In spite of their practical relevance, very little work has been done on these combined problems to date. The future of the project scheduling literature appears to be developing in the direction of combining the fundamental problems and developing efficient exact and heuristic methods for the resulting problems.

Sign in / Sign up

Export Citation Format

Share Document