K. Heeger
Equitable scheduling on a single machine
Heeger, K.; Hermelin, D.; Mertzios, G.B.; Molter, H.; Niedermeier, R.; Shabtay, D.
Authors
D. Hermelin
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
H. Molter
R. Niedermeier
D. Shabtay
Abstract
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.
Citation
Heeger, K., Hermelin, D., Mertzios, G., Molter, H., Niedermeier, R., & Shabtay, D. (2021). Equitable scheduling on a single machine. . https://doi.org/10.1609/aaai.v35i13.17404
Conference Name | 35th AAAI Conference on Artificial Intelligence (AAAI) |
---|---|
Conference Location | Vancouver, Canada |
Start Date | Feb 2, 2021 |
End Date | Feb 9, 2021 |
Acceptance Date | Dec 2, 2020 |
Online Publication Date | May 18, 2021 |
Publication Date | 2021 |
Deposit Date | Dec 3, 2020 |
Publicly Available Date | Mar 28, 2024 |
Series Number | 13 |
Series ISSN | 2159-5399,2374-3468 |
DOI | https://doi.org/10.1609/aaai.v35i13.17404 |
Files
Accepted Conference Proceeding
(263 Kb)
PDF
You might also like
Graphs with minimum fractional domatic number
(2023)
Journal Article
Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle
(2023)
Journal Article
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Conference Proceeding
Fast parameterized preprocessing for polynomial-time solvable graph problems
(2023)
Journal Article
The complexity of computing optimum labelings for temporal connectivity
(2022)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search