AbstractThis paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs on m identical machines. In our online model, all jobs are submitted over time. We show that the commonly used makespan criterion is not well suited to describe utilization for this online problem. Therefore, we directly address utilization and determine the maximum deviation from the optimal utilization for the given scheduling problem
AbstractVirtually all research in scheduling theory has been concerned with clairvoyant scheduling w...
International audienceWe consider in this work a classical online scheduling problem with release ti...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...
AbstractThis paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedule...
In the classical scheduling problems, it has been assumed that complete knowledge of the problem was...
We investigate an online version of a basic scheduling problem where a set of jobs has to be schedul...
AbstractWe investigate an online version of a basic scheduling problem where a set of jobs has to be...
We investigate an online version of the scheduling problem $P, NC|pmtn|C_{\max}$, where a set of job...
In the classical scheduling problems, it has been assumed that complete knowledge of the problem was...
International audienceWhen a computer system schedules jobs there is typically a significant cost as...
We derive the first performance guarantees for a combinatorial online algorithm that schedules stoch...
We derive the first performance guarantees for a combinatorial online algorithm that schedules stoch...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
In this paper we provide a survey of online scheduling in parallel machine environments with machine...
This paper establishes performance guarantees for online algorithms that schedule stochastic, nonpre...
AbstractVirtually all research in scheduling theory has been concerned with clairvoyant scheduling w...
International audienceWe consider in this work a classical online scheduling problem with release ti...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...
AbstractThis paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedule...
In the classical scheduling problems, it has been assumed that complete knowledge of the problem was...
We investigate an online version of a basic scheduling problem where a set of jobs has to be schedul...
AbstractWe investigate an online version of a basic scheduling problem where a set of jobs has to be...
We investigate an online version of the scheduling problem $P, NC|pmtn|C_{\max}$, where a set of job...
In the classical scheduling problems, it has been assumed that complete knowledge of the problem was...
International audienceWhen a computer system schedules jobs there is typically a significant cost as...
We derive the first performance guarantees for a combinatorial online algorithm that schedules stoch...
We derive the first performance guarantees for a combinatorial online algorithm that schedules stoch...
Makespan minimization onm identical machines is a fundamental scheduling problem. The goal is to ass...
In this paper we provide a survey of online scheduling in parallel machine environments with machine...
This paper establishes performance guarantees for online algorithms that schedule stochastic, nonpre...
AbstractVirtually all research in scheduling theory has been concerned with clairvoyant scheduling w...
International audienceWe consider in this work a classical online scheduling problem with release ti...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...
DOI
Add to ORKG