A PTAS FOR SINGLE-MACHINE SCHEDULING WITH RELEASE DATES AND JOB DELIVERY TO MINIMIZE MAKESPAN

摘要

We consider the single-machine scheduling problem with release dates and job delivery to minimize makespan. Preemption is not allowed in the processing of the jobs. All jobs are first processed on a single machine and then delivered by a capacitated vehicle to a single customer. The vehicle can deliver at most c >= 1 jobs in each shipment. The round-trip transportation time between the machine and customer is a constant T > 0. The problem was proved to be strongly NP-hard and a 3/2-approximation algorithm was presented in the literature. In this paper we provide a polynomial-time approximation scheme (PTAS) for the problem.