Single Machine Scheduling with Few Deadlines

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

Abstract

We study single-machine scheduling problems with few deadlines. We focus on two classical objectives, namely minimizing the weighted number of tardy jobs and the total weighted completion time. For both problems, we give a pseudopolynomial-time algorithm for a constant number of different deadlines. This algorithm is complemented with an ETH-based, almost tight lower bound. Furthermore, we study the case where the number of jobs with a nontrivial deadline is taken as parameter. For this case, the complexity of our two problems differ: Minimizing the total number of tardy jobs becomes fixed-parameter tractable, while minimizing the total weighted completion time is W[1]-hard.

Original languageAmerican English
Title of host publication18th International Symposium on Parameterized and Exact Computation, IPEC 2023
EditorsNeeldhara Misra, Magnus Wahlstrom
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773058
DOIs
StatePublished - 1 Dec 2023
Event18th International Symposium on Parameterized and Exact Computation, IPEC 2023 - Amsterdam, Netherlands
Duration: 6 Sep 20238 Sep 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume285

Conference

Conference18th International Symposium on Parameterized and Exact Computation, IPEC 2023
Country/TerritoryNetherlands
CityAmsterdam
Period6/09/238/09/23

Keywords

  • parameterized complexity
  • pseudopolynomial algorithms
  • Single-machine scheduling
  • tardy jobs
  • weighted completion time

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Single Machine Scheduling with Few Deadlines'. Together they form a unique fingerprint.

Cite this