Resource constrained portfolio scheduling problem (RCPoSP): A hybrid approach

Abstract

The resource constrained portfolio scheduling problem (RCPoSP), in which orders are grouped in portfolios, is proposed in this study. In the RCPoSP the objective is to deliver all orders in the portfolio at the same time after processing. This problem finds many applications in industrial services, manufacturing companies and, where all items (products, services, items etc.) ordered by the customer have to be delivered at the same time in one lot. The goal is to reduce the delivery costs and/or that all elements of the delivery have the same priority, etc. The presented problem also concerns the scheduling of new orders in project portfolios and/or a new project portfolio etc. The minimizations of makespan and/or resource needs for the portfolio are also discussed. The authors present a reference model for the RCPoSP and an intelligent framework for modeling and solving the modeled problem based on the original hybrid approach. The opportunity to ask questions, receive answers as well as data representation in the form of facts constitute an invaluable intelligent support to users utilizing this framework. The goal is to provide an intelligent hybrid framework for stating and solving constraint satisfaction or optimization of RCPoSPs. The calculation examples illustrate the capabilities and computational efficiency of the proposed framework.