Extensions of an integrated approach for multi-resource shop scheduling

Abstract

In a previous work, we proposed an integrated approach for a rather general shop scheduling problem, with multi-resource, exibility and non-linear routings. In this paper, we want to overcome some of the limitations of the approach. In particular, an operation that needs several resources might not need all the resources during its entire processing time. Our first extension allows a resource to be released before the end of the operation. The second extension considers the fact that, for a given operation, one might have to prevent a set of incompatible resources to be chosen.