Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times

The paper deals with the single-machine scheduling problem in which each job has a processing time and a delivery time, a set of jobs is divided into batches and a setup time is incurred whenever there is a switch from a job in one batch to a job in another batch. The objective is to find a sequence of jobs which minimizes the time by which all jobs are delivered. Two approximation algorithms with the worst-case performance ratio of 1.5 are given for the case with sequence independent batch setup times. Results of computational experiments are also provided.