Optimal algorithms and a PTAS for cost-aware scheduling

Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algorithm that computes for any given sequence of jobs an optimal schedule, i.e., the optimal set of time-slots to be used for scheduling jobs according to the given sequence. This result is based on dynamic programming using a subtle analysis of the structure of optimal solutions and a potential function argument. With this algorithm, we solve the unweighted problem optimally in polynomial time. Furthermore, we argue that there is a (4+ε)-approximation algorithm for the strongly NP-hard problem with individual job weights. For this weighted version, we also give a PTAS based on a dual scheduling approach introduced for scheduling on a machine of varying speed.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings
EditorsGiuseppe F. Italiano, Giovanni Pighizzini, Donald T. Sannella
PublisherSpringer-Verlag
Pages211-222
Number of pages12
ISBN (Print)9783662480533
DOIs
StatePublished - 2015
Event40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015 - Milan, Italy
Duration: Aug 24 2015Aug 28 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9235
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015
CountryItaly
CityMilan
Period08/24/1508/28/15

Fingerprint Dive into the research topics of 'Optimal algorithms and a PTAS for cost-aware scheduling'. Together they form a unique fingerprint.

Cite this