Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

This paper presents a priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resourc...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2007-04, Vol.178 (2), p.374-390
Main Authors: Buddhakulsomsiri, Jirachai, Kim, David S.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Heuristic
Heuristics
Job shops
Moving resource strength
Operational research and scientific management
Operational research. Management science
Priorities
Priority rules
Project management
Project scheduling
Scheduling
Scheduling, sequencing
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resource vacations, which are known in advance. A new concept called moving resource strength is developed to help identify project situations where activity splitting is likely to be beneficial during scheduling. The moving resource strength concept is implemented in priority rule-based heuristics to control activity splitting when scheduling. Multiple comparisons of the performance of combination of activity–mode priority rules used in the heuristics are provided. Computational experiments demonstrate the effectiveness of the heuristic in reducing project makespan, and minimizing activity splitting.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.02.010