An -Competitive Algorithm for Online Machine Minimization
We consider the online machine minimization problem in which jobs with hard deadlines
arrive online over time at their release dates. The task is to determine a feasible preemptive …
arrive online over time at their release dates. The task is to determine a feasible preemptive …
A general framework for handling commitment in online throughput maximization
We study a fundamental online job admission problem where jobs with deadlines arrive
online over time at their release dates, and the task is to determine a preemptive single …
online over time at their release dates, and the task is to determine a preemptive single …
Robust EV Scheduling in Charging Stations Under Uncertain Demands and Deadlines
To enable widespread use of electric vehicles (EVs), large-scale public charging stations
with fast chargers are being planned in places such as shop** malls and office car parks …
with fast chargers are being planned in places such as shop** malls and office car parks …
An improved algorithm for online machine minimization
The online machine minimization problem seeks to design a preemptive scheduling
algorithm on multiple machines—each job j arrives at its release time rj, has to be processed …
algorithm on multiple machines—each job j arrives at its release time rj, has to be processed …
Optimally handling commitment issues in online throughput maximization
We consider a fundamental online scheduling problem in which jobs with processing times
and deadlines arrive online over time at their release dates. The task is to determine a …
and deadlines arrive online over time at their release dates. The task is to determine a …
An O (log log m)-competitive Algorithm for Online Machine Minimization
This paper considers the online machine minimization problem, a basic real time scheduling
problem. The setting for this problem consists of n jobs that arrive over time, where each job …
problem. The setting for this problem consists of n jobs that arrive over time, where each job …
[BOOK][B] Handling critical tasks online: Deadline scheduling and convex-body chasing
K Schewior - 2016 - search.proquest.com
In this thesis, we study two fundamental online optimization problems in which tasks arrive
over time and require to be processed either immediately or until a certain deadline. The …
over time and require to be processed either immediately or until a certain deadline. The …
[PDF][PDF] A note on online machine minimization
The machine minimization problem is to schedule a set of jobs with specified time intervals
on the smallest possible number of machines. Each job j arrives at its release time rj, has to …
on the smallest possible number of machines. Each job j arrives at its release time rj, has to …
Packing sporadic real-time tasks on identical multiprocessor systems
In real-time systems, in addition to the functional correctness recurrent tasks must fulfill
timing constraints to ensure the correct behavior of the system. Partitioned scheduling is …
timing constraints to ensure the correct behavior of the system. Partitioned scheduling is …
SIGACT News Online Algorithms Column 30: 2016 in review
R van Stee - ACM SIGACT News, 2017 - dl.acm.org
In this column, I will discuss some recent papers in online algorithms that appeared in 2016.
Quite a number of papers on online algorithms appeared during the year, and I have had to …
Quite a number of papers on online algorithms appeared during the year, and I have had to …