Resource-Constrained Project and Multi-Project Scheduling Problems (RCPSPs and RCMPSPs) have been essential topics of study over the last three decades. Both problems consist of activities that must be scheduled subject to precedence and resource constraints. This paper surveys studies of RCPSPs and RCMPSPs under consideration of four categories of project activities, simply recorded as categories A, B, C, and D. Category A refers to activities can be performed using fixed resources along The Y-axis over fixed durations along The X-axis, and cannot be interrupted. Category B applies to activities that can be performed using the same type of resource in category A but can be interrupted. Category C refers to activities that can be performed using flexible resources over flexible durations and cannot be interrupted. Category D refers to activities can be performed using flexible resources over flexible durations and can be interrupted. Many algorithms have been developed to solve the RCPSPs and RCMPSPs when activities are classified individually under category A, B, or C. However, in practice, welding, cutting or assembly activities in a manufacturing projects for an oil cargo can be under a new category so-called D. The project manager can speed up or slow down these activities by allocating or removing more resources, and these activities can be interrupted or can be resumed at any time. From the perspective of activity categories, we intend to review the literature on RCPSPs and RCMP-SPs and to obtain the new research directions for solving the problems.

Planning and scheduling processes in project management are carried out sequentially in practice, i.e. planning project activities first without visibility of resource limitation, and then scheduling the project according to these pre-planned activities. This is a need to integrate these two processes. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called "the Minimum Moments of Resources Required around X-Y axes (MMORR)", we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

No abstract

No abstract

No abstract