Project Scheduling with Time Windows and Scarce Resources

2002 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Jürgen Zimmermann
Keyword(s):  
Project Scheduling ◽  
Time Windows ◽  
Scarce Resources

Project Scheduling with Time Windows and Scarce Resources

2003 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Jürgen Zimmermann
Keyword(s):  
Project Scheduling ◽  
Time Windows ◽  
Scarce Resources

scholarly journals Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Yi Han ◽  
Ikou Kaku ◽  
Jianhu Cai ◽  
Yanlai Li ◽  
Chao Yang ◽  
...  
Keyword(s):  
Project Scheduling ◽  
Single Mode ◽  
Medium Size ◽  
Scheduling Problems ◽  
Shuffled Frog Leaping Algorithm ◽  
Scarce Resources ◽  
Splitting Number ◽  
Shuffled Frog Leaping ◽  
Project Scheduling Problem ◽  
Effectiveness And Efficiency

This paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.

A RESOURCE OPTIMISATION BASED HEURISTIC FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM

2019 ◽  
Vol XVI (4) ◽  
pp. 115-124
Author(s):  
Mazhar Ali ◽  
Saif Ullah ◽  
Mirza Jahanzaib
Keyword(s):  
Project Scheduling ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Resource Constrained ◽  
Shared Resources ◽  
Penalty Cost ◽  
Scarce Resources ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem ◽  
And Shifts

Resource constrained project scheduling problem has significant application in industries. Although several heuristic solutions have been developed in the literature to address this problem, most of these have lesser focus on scheduling of shared and scarce resources. The presented study proposes a resource optimisation based heuristic (ROBH) to optimise the utilisation of shared resources so as to minimise the penalty cost of projects. The proposed ROBH identifies shared resources within the project activities and shifts the activities from the bottleneck resource to the residual resources. The performance of the proposed ROBH was tested using the standard benchmark instances of project scheduling problems available in the existing literature. The results were compared with those obtained from the heuristics available in the project scheduling problem library. This comparison indicated that the results provided by ROBH are significant as compared to the results obtained from the heuristics available in the literature.

Sign in / Sign up

Export Citation Format

Share Document