Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling
by Umut Beşikçi; Ümit Bilge; Gündüz Ulusoy
International Journal of Mathematics in Operational Research (IJMOR), Vol. 14, No. 4, 2019

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.

Online publication date: Wed, 17-Jul-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com