Equitable Scheduling on a Single Machine

Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay

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


We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of the problem at once. In particular, we have n clients over a period of m days, where each client has a single job with its own processing time and deadline per day. Our goal is to provide a schedule for each of the m days, so that each client is guaranteed to have their job meet its deadline in at least k ≤ m days. This corresponds to an equitable schedule where each client is guaranteed a minimal level of service throughout the period of m days. We provide a thorough analysis of the computational complexity of three main variants of this problem, identifying both efficient algorithms and worst-case intractability results.

Original languageAmerican English
Title of host publication35th AAAI Conference on Artificial Intelligence, AAAI 2021
Number of pages8
ISBN (Electronic)9781713835974
StatePublished - 1 Jan 2021
Event35th AAAI Conference on Artificial Intelligence, AAAI 2021 - Virtual, Online
Duration: 2 Feb 20219 Feb 2021

Publication series

Name35th AAAI Conference on Artificial Intelligence, AAAI 2021


Conference35th AAAI Conference on Artificial Intelligence, AAAI 2021
CityVirtual, Online


  • Computer Science - Data Structures and Algorithms
  • Computer Science - Discrete Mathematics

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence


Dive into the research topics of 'Equitable Scheduling on a Single Machine'. Together they form a unique fingerprint.

Cite this