Scheduling with a limited testing budget
Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang
Abstract
Open-access reader
Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang
Abstract
Open-access reader
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the workshop scope include scheduling with variable job processing, e.g.controllable job processing times, time-dependent job processing times, position-dependent job processing times, resource-dependent job processing times, discretecontinuous scheduling;scheduling with various factors affecting job execution, e.g.aging, alteration, deterioration, learning, shortening; scheduling on variable speed machines, e.g.energy-efficient scheduling, scheduling under time-of-use electricity tariffs, scheduling with ratemodifying activities;scheduling problems with constraints on machine availability, e.g.scheduling with maintenance activities, scheduling on machines with non-availability periods; scheduling under uncertainty, e.g.robust scheduling, stochastic scheduling, scheduling over scenarios, scheduling with explorable uncertainty;scheduling with a partial, changing in time, data on jobs or machines, e.g.online scheduling, semi-online scheduling; scheduling in non-classic models of job preemption, e.g.malleable task scheduling, scheduling pliable jobs, scheduling splittable jobs; other scheduling problems with job or machine parameters changing in time, e.g.scheduling in data gathering networks, scheduling in health care systems, etc.The aim of the IWDSP 2023 workshop is to present the recent research in these important domains of scheduling theory.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the workshop scope include scheduling with variable job processing, e.g.controllable job processing times, time-dependent job processing times, position-dependent job processing times, resource-dependent job processing times, discretecontinuous scheduling;scheduling with various factors affecting job execution, e.g.aging, alteration, deterioration, learning, shortening; scheduling on variable speed machines, e.g.energy-efficient scheduling, scheduling under time-of-use electricity tariffs, scheduling with ratemodifying activities;scheduling problems with constraints on machine availability, e.g.scheduling with maintenance activities, scheduling on machines with non-availability periods; scheduling under uncertainty, e.g.robust scheduling, stochastic scheduling, scheduling over scenarios, scheduling with explorable uncertainty;scheduling with a partial, changing in time, data on jobs or machines, e.g.online scheduling, semi-online scheduling; scheduling in non-classic models of job preemption, e.g.malleable task scheduling, scheduling pliable jobs, scheduling splittable jobs; other scheduling problems with job or machine parameters changing in time, e.g.scheduling in data gathering networks, scheduling in health care systems, etc.The aim of the IWDSP 2023 workshop is to present the recent research in these important domains of scheduling theory.
Key concepts: Rate-monotonic scheduling, Fair-share scheduling, Two-level scheduling, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling, Computer science, Round-robin scheduling, Earliest deadline first scheduling