Extensions of an integrated approach for multi-resource shop scheduling

Abstract

International audienceIn a previous work, we proposed an integrated approach for a rather general shop scheduling problem, with multiresource, flexibility, and nonlinear 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

On the multiresource flexible job‐shop scheduling problem with arbitrary precedence graphs

“…In terms of future research, it is worth studying the policies discussed in Dauzère-Pérès and Pavageau (2003), where all resources assigned to an operation may not be simultaneously occupied; instead, an operation may not start or end simultaneously on all its assigned resources.…”

Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching

“…In this problem, the authors assume that every job needs all kinds of resources and operators are not considered. Dauzė re-Pérė s and Pavageau [31] extend the study by allowing resources to be released before completing in one procedure and considering that incompatible resources cannot be chosen by one procedure at the same time.…”