TY - GEN
T1 - Scheduling with Testing on Multiple Identical Parallel Machines
AU - Albers, Susanne
AU - Eckl, Alexander
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration of a task. Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. We consider this problem within the setting of multiple identical parallel machines and present competitive deterministic algorithms and lower bounds for the objective of minimizing the makespan of the schedule. In the non-preemptive setting, we present the SBS algorithm whose competitive ratio approaches 3.1016 if the number of machines becomes large. We compare this result with a simple greedy strategy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.
AB - Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration of a task. Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. We consider this problem within the setting of multiple identical parallel machines and present competitive deterministic algorithms and lower bounds for the objective of minimizing the makespan of the schedule. In the non-preemptive setting, we present the SBS algorithm whose competitive ratio approaches 3.1016 if the number of machines becomes large. We compare this result with a simple greedy strategy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.
KW - Competitive analysis
KW - Explorable uncertainty
KW - Identical parallel machines
KW - Makespan minimization
KW - Online scheduling
UR - http://www.scopus.com/inward/record.url?scp=85113562837&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-83508-8_3
DO - 10.1007/978-3-030-83508-8_3
M3 - Conference contribution
AN - SCOPUS:85113562837
SN - 9783030835071
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 29
EP - 42
BT - Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings
A2 - Lubiw, Anna
A2 - Salavatipour, Mohammad
PB - Springer Science and Business Media Deutschland GmbH
T2 - 17th International Symposium on Algorithms and Data Structures, WADS 2021
Y2 - 9 August 2021 through 11 August 2021
ER -