scholarly journals Effective Project Scheduling Under Workspace Congestion and Workflow Disturbance Factors

2014 ◽  
Vol 2 (1) ◽  
pp. 35 ◽  
Author(s):  
Vitaly Semenov ◽  
Anton Anichkin ◽  
Sergey Morozov ◽  
Oleg Tarlapan ◽  
Vladislav Zolotov
Keyword(s):  
Project Scheduling ◽  
Construction Projects ◽  
Critical Path ◽  
Resource Utilisation ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Planning And Scheduling ◽  
Advanced Planning ◽  
Project Scheduling Problem ◽  
Spatio Temporal

Effective project management implies the use of advanced planning and scheduling methods that allow to determine feasible sequences of activities and to complete a project on time and on budget. Traditional scheduling tools like fundamental Critical Path Method (CPM) and various methods for Resource Constrained Project Scheduling Problem (RCPSP) and Time Constrained Project Scheduling Problem (TCPSP) have many shortcomings for construction projects where spatial factor plays a critically important role. Previous attempts to interpret space as a specific resource were successful for particular problems of line-of-balance scheduling, space scheduling, dynamic layout planning, horizontal and vertical logic scheduling, workspace congestion mitigating, scheduling multiple projects with movable resources, spatial scheduling of repeated and grouped activities and motion planning. However, none of these methods considers the spatio-temporal requirements in a holistic framework of generic RCPSP problem and provides feasible results accounting for workspace and workflow factors. In this paper we start with the classical RCPSP statement and then present mathematically strong formalisation of the extended generalised problem, taking into account workspace congestion and workflow disturbance constraints specified in practically meaningful and computationally constructive ways. For the generalised RCPSP problem an effective scheduling method is proposed. The method tends to minimise the project makespan while satisfying timing constraints and precedence relations, not exceeding resource utilisation limits, avoiding workspace congestions and keeping workflows continuous. The method reuses so-called serial scheduling scheme and provides for additional computational routines and heuristic priority rules to generate feasible schedules satisfying all the imposed requirements. Advantages of the method and prospects for its application to industrial needs are outlined in the paper too.

On the Latest Times and Float Times of Activities in a Fuzzy Project Network with LR Fuzzy Numbers

2012 ◽  
Vol 2 (2) ◽  
pp. 91-101 ◽  
Author(s):  
V. Sireesha ◽  
N. Ravi Shankar ◽  
K. Srinivasa Rao ◽  
P. Phani Bushan Rao
Keyword(s):  
Project Scheduling ◽  
Fuzzy Numbers ◽  
Critical Path ◽  
Real Life ◽  
New Method ◽  
Scheduling Problem ◽  
Forward Pass ◽  
Project Scheduling Problem ◽  
Project Network ◽  
Activity Times

In this paper, the authors propose a new method to compute the fuzzy latest times and float times of activities for a project scheduling problem with fuzzy activity times. The authors have considered LR fuzzy numbers to represent the activity times. As the data of the problem are LR fuzzy numbers, the authors have shown that the results are also in terms of LR fuzzy numbers. Total float time of each activity can be found by this method without using the forward pass and backward pass computations. The authors use an example to illustrate the method. This paper shows the advantages of this method over the existing methods with great clarity. The proposed method illustrates its application to fuzzy critical path problems occurring in real life situations.

Resource Constrained Multi-Project Scheduling Problem with Resource Transfer Times

2015 ◽  
Vol 32 (06) ◽  
pp. 1550048 ◽  
Author(s):  
M. Suresh ◽  
Pankaj Dutta ◽  
Karuna Jain
Keyword(s):  
Project Scheduling ◽  
Net Present Value ◽  
Resource Constraints ◽  
Heuristic Approach ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Two Phase ◽  
Resource Transfer ◽  
Project Scheduling Problem ◽  
Transfer Times

Scheduling multi-project is a complex decision making process. It involves the effective and timely allocation of resources to different projects. In the case of multi-project, resources are often transferred between the projects. It consumes both time and cost, when projects are situated in different geographic locations. As a result, the net present value (NPV) of multi-projects is significantly impacted by the resource transfer time. In this paper, a new genetic algorithm (GA) approach to the multi-project scheduling problem with resource transfer times is presented, where the NPV of all projects is maximized subject to renewable resource constraints. The paper also presents a heuristic approach using two phase priority rules for the same problem. We conduct a comprehensive analysis of 60 two-phase priority rules. The proposed GA approach is compared to the heuristic approach using the well-known priority rules. An extensive computational experiment is reported.

Development of Hybrid Genetic Algorithms for the Resource Constrained Multi-Project Scheduling Problem

2005 ◽  
Author(s):  
Wenjian Liu ◽  
Jinghua Li
Keyword(s):  
Genetic Algorithm ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Hybrid Genetic Algorithm ◽  
Second Phase ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Resource Constrained ◽  
Chromosome Representation ◽  
Project Scheduling Problem

In multi-project environment, multiple projects share and compete for the limited resources to achieve their own goals. Besides resource constraints, there exist precedence constraints among activities within each project. This paper presents a hybrid genetic algorithm to solve the resource-constrained multi-project scheduling problem (RCMPSP), which is well known NP-hard problem. Objectives described in this paper are to minimize total project time of multiple projects. The chromosome representation of the problem is based on activity lists. The proposed algorithm was operated in two phases. In the first phase, the feasible schedules are constructed as the initialization of the algorithm by permutation based simulation and priority rules. In the second phase, this feasible schedule was optimized by genetic algorithm, thus a better approximate solution was obtained. Finally, after comparing several different algorithms, the validity of proposed algorithm is shown by a practical example.

A Critical Chain Project Scheduling Problem with Multi-Mode

2011 ◽  
Vol 697-698 ◽  
pp. 541-545
Author(s):  
Wu Liang Peng ◽  
Q.J. Jiao
Keyword(s):  
Project Scheduling ◽  
Single Mode ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Application Range ◽  
Decision Level ◽  
Project Scheduling Problem ◽  
Project Network ◽  
Critical Chain ◽  
Multi Mode

Critical chain method (CCM) is a new project method which combines project network technologies and management arts. Although there are lots of researches on it, the existing critical chain method has some drawbacks limiting its decision level in practical application. To improve the decision level and application range of critical chain method, the critical chain method with multi-mode is studied. The project network technology is the foundation of project scheduling problem. All the existing project management tools can only support single mode project network, that is, all the project activities have only one executive mode. We study the multi-mode project network as the foundation of multi-mode CC. Furthermore, by relating multi-mode project network to critical chain method, the critical chain method with multi-mode is presented, and the implementation procedure is proposed. In the implementation of multi-mode CCM, the activity priority rules and mode priority rules are investigated.

Sign in / Sign up

Export Citation Format

Share Document