Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling

Beşikci, Umut and Bilge, Ümit and Ulusoy, Gündüz (2017) Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling. (Accepted/In Press)

There is a more recent version of this item available.
[thumbnail of Abstract & Keywords] PDF (Abstract & Keywords)

Download (45kB)


The most common approach in the multi-project scheduling literature considers resources as a common pool shared among all projects. However, different resource management strategies may be required for different problem environments. We present the Relaxed Resource Dedication (RRD) policy, which prevents the sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. We treat the case where the available amounts of resources -namely, the capacities- are decision variables subject to a limited budget. This capacity planning problem, called the Resource Portfolio Problem, is investigated under the RRD policy employing both renewable and nonrenewable resources with multiple modes of usage. A mixed integer linear programming model to minimize total weighted tardiness is proposed. To obtain some benchmark solutions for this hard problem, the branch and cut procedure of ILOG CPLEX is modified by customized branching strategies, feasible solution generation schemes and valid inequalities.
Item Type: Article
Uncontrolled Keywords: Multi-mode Resource Constrained Multi-project Scheduling; Resource Dedication; Resource Portfolio Allocation; Branch and Cut.
Subjects: T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences
Depositing User: Gündüz Ulusoy
Date Deposited: 29 Mar 2019 09:57
Last Modified: 26 Apr 2022 10:02

Available Versions of this Item

Actions (login required)

View Item
View Item