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

• Published in: International journal of production research Vol. 50; no. 8; pp. 2304 - 2320
• Main Authors: Jula, Payman, Rafiey, Arash
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis Group 15.04.2012; Taylor & Francis; Taylor & Francis LLC
• Subjects: Algorithms; Applied sciences; Chains; Computer simulation; Exact sciences and technology; Inventory control, production control. Distribution; Job shops; Network flow problem; Networks; Operational research and scientific management; Operational research. Management science; operations management; Optimization algorithms; production management; Robustness; Scheduling; Searching; Sequential scheduling; Setup times; Studies; Work in process; Short term; Network structure; operations management; Coordination; Task scheduling; Scheduling; In-process inventory; Workload; Production management; Time window; Setup time; Robustness; Single machine
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2011.575089

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.