A PTAS for single machine scheduling with controllable processing times

P. Schuurman, G.J. Woeginger

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

1 Citaat (Scopus)


Abstract: We deal with a single machine scheduling problem in which each job has a release date, a delivery time and a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. The objective is to find a schedule that minimizes the total cost, that is, the latest delivery time of any job plus the total compression cost. In this note we discuss how the techniques of Hall and Shmoys [?] and Hall [?] can directly be applied to design a polynomial time approximation scheme for this problem. Keywords. Scheduling, worst case analysis, approximation algorithm, approximation scheme, controllable processing time.
Originele taal-2Engels
Pagina's (van-tot)369-378
TijdschriftActa Cybernetica
Nummer van het tijdschrift3
StatusGepubliceerd - 2002


Duik in de onderzoeksthema's van 'A PTAS for single machine scheduling with controllable processing times'. Samen vormen ze een unieke vingerafdruk.

Citeer dit