An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times

Insertion of an operation inside an existing schedule is the central part of some neighbourhood search methods for off-line job-shop scheduling. It is also a basic tool to integrate unexpected jobs during on-line scheduling. In this paper is presented a new polynomial insertion algorithm of an operation inside a multi-resource job-shop schedule with sequence-dependent setup times. The considered objective is maximum lateness minimization. The algorithm is first described for the classical job-shop scheduling problem. Then, multi-resource requirements are introduced for the operations. Last, sequence-dependent setup times are considered in the multi-resource context. It is shown in the three cases that some dominance properties make the proposed insertion algorithm superior to the enumeration algorithms that can be used alternatively.