Abstract
Scheduling of independent jobs with release dates so as to minimize the total weighted completion time is a well-known scheduling problem. Here, we study it for the classic machine environment of uniformly related machines. An efficient polynomial time approximation scheme (an EPTAS) is a family of (1 + ε)-approximation algorithms where the running time is bounded by a polynomial in the input size times a function of ε > 0. For problems that are NP-hard in the strong sense, as it is the case for the problem studied here, an EPTAS is the best possible approximation scheme. We design an EPTAS for the problem by employing known techniques and introducing a large collection of new methods.
| Original language | English |
|---|---|
| Title of host publication | 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025 |
| Editors | Pawel Gawrychowski, Filip Mazowiecki, Michal Skrzypczak |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (Electronic) | 9783959773881 |
| DOIs | |
| State | Published - 20 Aug 2025 |
| Event | 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025 - Warsaw, Poland Duration: 25 Aug 2025 → 29 Aug 2025 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 345 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025 |
|---|---|
| Country/Territory | Poland |
| City | Warsaw |
| Period | 25/08/25 → 29/08/25 |
Bibliographical note
Publisher Copyright:© Leah Epstein and Asaf Levin.
Keywords
- Approximation schemes
- Min-sum objectives
- Scheduling algorithms
ASJC Scopus subject areas
- Software