About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
MCPL 2013
Conference paper
A resource constrained project scheduling problem with bounded multitasking
Abstract
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. © IFAC.