Coordinated scheduling of a single machine with sequence-dependent setup times and time-window constraints

In this paper we consider the selection and scheduling of several jobs on a single machine with sequence-dependent setup times and strictly enforced time-window constraints on the start times of each job. We demonstrate how to develop network-based algorithms to sustain the desired work in process (WIP) profile in a manufacturing environment. Short-term production targets are used to coordinate decentralised local schedulers and to make the objectives of specific areas in line with the chain objectives. A wide range of test problems with two different network structures are simulated. The effectiveness, efficiency, and robustness of the proposed algorithms are analysed and compared with an exhaustive search approach.