## Abstract

Generalizing many well-known and natural scheduling problems, scheduling with job-specific cost functions has gained a lot of attention recently. In this setting, each job incurs a cost depending on its completion time, given by a private cost function, and one seeks to schedule the jobs to minimize the total sum of these costs. The framework captures many important scheduling objectives such as weighted flow time or weighted tardiness. Still, the general case as well as the mentioned special cases are far from being very well understood yet, even for only one machine. Aiming for better general understanding of this problem, in this paper we focus on the case of uniform job release dates on one machine for which the state of the art is a 4-approximation algorithm. This is true even for a special case that is equivalent to the covering version of the well-studied and prominent unsplittable flow on a path problem, which is interesting in its own right. For that covering problem, we present a quasi-polynomial time (1 + ε)-approximation algorithm that yields an (e + ε)-approximation for the above scheduling problem. Moreover, for the latter we devise the best possible resource augmentation result regarding speed: a polynomial time algorithm which computes a solution with optimal cost at 1 + ε speedup. Finally, we present an elegant QPTAS for the special case where the cost functions of the jobs fall into at most logn many classes. This algorithm allows the jobs even to have up to logn many distinct release dates. All proposed quasi-polynomial time algorithms require the input data to be quasi-polynomially bounded.

Original language | English |
---|---|

Title of host publication | Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings |

Publisher | Springer Verlag |

Pages | 625-636 |

Number of pages | 12 |

Edition | PART 1 |

ISBN (Print) | 9783662439470 |

DOIs | |

State | Published - 2014 |

Externally published | Yes |

Event | 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark Duration: 8 Jul 2014 → 11 Jul 2014 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Number | PART 1 |

Volume | 8572 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 |
---|---|

Country/Territory | Denmark |

City | Copenhagen |

Period | 8/07/14 → 11/07/14 |