We study the problem of non-preemptively scheduling n jobs, each job j with a release time
t_j tj, a deadline d_j dj, and a processing time p_j pj, on m parallel identical machines …

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 …

A competitive algorithm for throughput maximization on identical machines | Mathematical
Programming Skip to main content SpringerLink Account Menu Find a journal Publish with us …

We study an online distribution problem in which a producer has to send a load from an
origin to a destination. At each time period before the deadline, they ask for transportation …

We study a scheduling problem arising in demand response management in smart grid.
Consumers send in power requests with a flexible feasible time interval during which their …

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 …

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 …

In this paper we investigate the power of migration in online scheduling on multiple parallel
machines. The problem is to schedule preemptable jobs with release dates and deadlines …

This paper studies the online machine minimization problem, where the jobs have real
release times, uniform processing times and a common deadline. We investigate how the …

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 …