A Resource Constrained Project Scheduling Problem with Bounded Multitasking

摘要

The Resource Constrained Project Scheduling Problem (RCPSP) is the sub-class of the Scheduling Problem that deals with scenarios where personnel or workforce employed to perform the tasks are limited and each job has an arrival time, a due date, and a penalty associated to delays. In this article, we consider a special case of the RCPSP, which we will denote as the Resource Constrained Project Scheduling Problem with Bounded Multitasking (RCPSPBM), where human analysts are able to perform a limited number of tasks in parallel in exchange for cognitive overhead costs. We present a description of the problem and introduce an exact Mixed-Integer Linear Program formulation of the (RCPSPBM), used to evaluate the efficiency of (typically online) algorithms employed by dispatchers.