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

Authors: Umut Beşikçi; Ümit Bilge; Gündüz Ulusoy

Addresses: Triodor ArGe Yazılım ve Bilişim Tic. Ltd. Şti., Aydınevler, Durak Sokak 7/9, Maltepe, 34854 Istanbul, Turkey ' Department of Industrial Engineering, Boğaziçi University, Bebek, 34342 Istanbul, Turkey ' Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı, Tuzla, 34956 Istanbul, Turkey

Abstract: 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 non-renewable resources with multiple modes of usage. A mixed integer linear programming model to minimise 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 customised branching strategies, feasible solution generation schemes and valid inequalities.

Keywords: multi-mode resource constrained multi-project scheduling; resource dedication; resource portfolio allocation; branch and cut.

DOI: 10.1504/IJMOR.2019.100739

International Journal of Mathematics in Operational Research, 2019 Vol.14 No.4, pp.541 - 567

Received: 24 Apr 2017
Accepted: 17 Dec 2017
Published online: 17 Jul 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article