Abstract:
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. The proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. The proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. Resources can be non-consumable, consumable, or doubly constrained. The paper also presents a real-life case study dealing with scheduling of ship repair activities.
Machine summary:
"Ahluwaliaa, and Pedro Sennab a West Virginia University, Morgantown, WV, USA b Federal Center for Technological Education of Rio de Janeiro, Rio de Janeiro, Brazil Abstract This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem.
1. Introduction Project scheduling consists of determining start times for all tasks such that temporal and/or resource constraints are satisfied and a given objective is optimized (Józefowska and Weßglarz, 2006).
The case of Multi-mode Resource Constrained Multi-Project Scheduling Problem (MRCMPSP) has not been addressed adequately due to its size and complexity.
Constraint set defined by equation (11) imposes the maximum quantity of available renewable resource with capability c at time t for any project, task, and mode.
Constraint set (18) imposes the maximum quantity of available nonrenewable resources with capability c at time t for any project, task, and mode.
In this research, alternate ways of performing a task (multi-modes), multiple worker skills levels, renewable and non-renewable resources, were considered.
STREAM also solved a scheduling problem with 10,434 tasks, 15,000 modes, and 400 multi-skilled resources, in 810 seconds, while running 100 projects simultaneously.
6. Contributions and Future Research This research expanded the existing Resource Constrained Project Scheduling Problem (RCPSP) methodology to include multiple combinatorial task modes, projects, and resource skills.
The Combinatorial Multi-mode Resource Constrained Multi-project Scheduling Problem (CMRCMPSP) includes capabilities provided by RCPSP, MRCPSP, RCMPSP, and MRCMPS methods.
A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version."