Group technology approach to the open shop scheduling problem with batch setup times

• Authors: V. A. Strusevich
• Venue: Operations Research Letters
• Year: 2000

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a 54-approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 54.