[HTML][HTML] 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 …
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 …
Online throughput maximization on unrelated machines: Commitment is no burden
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 …
A new approach to online scheduling: approximating the optimal competitive ratio
We propose a new approach to competitive analysis in online scheduling by introducing the
novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically …
novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically …
Online scheduling with hard deadlines
SA Goldman, J Parwatikar, S Suri - Journal of Algorithms, 2000 - Elsevier
We study non-preemptive, online admission control in the hard deadline model: each job
must either be serviced prior to its deadline or be rejected. Our setting consists of a single …
must either be serviced prior to its deadline or be rejected. Our setting consists of a single …
Online scheduling with known arrival times
NG Hall, ME Posner, CN Potts - Mathematics of Operations …, 2009 - pubsonline.informs.org
We consider an online scheduling environment where decisions are made without
knowledge of the data of jobs that may arrive later. However, additional jobs can only arrive …
knowledge of the data of jobs that may arrive later. However, additional jobs can only arrive …
Scheduling for flow-time with admission control
We consider the problem of scheduling jobs on a single machine with preemption, when the
server is allowed to reject jobs at some penalty. We consider minimizing two objectives: total …
server is allowed to reject jobs at some penalty. We consider minimizing two objectives: total …
Weighted flow time does not admit o (1)-competitive algorithms
N Bansal, HL Chan - Proceedings of the twentieth annual ACM-SIAM …, 2009 - SIAM
We consider the classic online scheduling problem of minimizing the total weighted flow
time on a single machine with preemptions. Here, each job j has an arbitrary arrival time rj …
time on a single machine with preemptions. Here, each job j has an arbitrary arrival time rj …
Commitment and slack for online load maximization
S Jamalabadi, C Schwiegelshohn… - Proceedings of the …, 2020 - dl.acm.org
We consider a basic admission control problem in which jobs with deadlines arrive online
and our goal is to maximize the total volume of executed job processing times. We assume …
and our goal is to maximize the total volume of executed job processing times. We assume …
Minimizing weighted flow time
N Bansal, K Dhamdhere - ACM Transactions on Algorithms (TALG), 2007 - dl.acm.org
We consider the problem of minimizing the total weighted flow time on a single machine with
preemptions. We give an online algorithm that is O (k)-competitive for k weight classes. This …
preemptions. We give an online algorithm that is O (k)-competitive for k weight classes. This …