2022
DOI: 10.1109/access.2022.3195045
|View full text |Cite
|
Sign up to set email alerts
|

Coordinated Planning and Scheduling of Multiple Projects With New Projects Arrival Under Resource Constraint Using Drum Buffer Rope Heuristic

Abstract: Planning and scheduling of multiple projects is significant for efficient utilization of constraint resources. However, in most of the project based companies, planning and scheduling of projects is performed in hierarchical manner with less focus given on coordination between the planning and scheduling levels, which leads to make inefficient plans and cause delays in projects and underutilize the resources. Therefore, current research is focused on coordinated planning and scheduling of multiple projects und… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 68 publications
0
1
0
Order By: Relevance
“…He, Zhang and Yuce (2022) proposed a genetic and ant colony optimization algorithm for resource planning and multi-project scheduling. Saif, Yue and Awadh (2022) considered the arrival of new projects in the planning horizons and proposed a drum buffer rope heuristic for scheduling multiple projects. Zhang, Hu, Cao, and Wu (2022) dealt with multi-mode multi-project inverse scheduling problems and proposed a modified particle swarm optimization algorithm combined with tabu search.…”
Section: Literature Reviewmentioning
confidence: 99%
“…He, Zhang and Yuce (2022) proposed a genetic and ant colony optimization algorithm for resource planning and multi-project scheduling. Saif, Yue and Awadh (2022) considered the arrival of new projects in the planning horizons and proposed a drum buffer rope heuristic for scheduling multiple projects. Zhang, Hu, Cao, and Wu (2022) dealt with multi-mode multi-project inverse scheduling problems and proposed a modified particle swarm optimization algorithm combined with tabu search.…”
Section: Literature Reviewmentioning
confidence: 99%