International audienceThe speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be grouped into at most m bags while the processing speeds of the machines are unknown. After the speeds are revealed, the grouped jobs must be assigned to the machines without being separated. To evaluate the performance of algorithms, we determine upper bounds on the worst-case ratio of the algorithm's makespan and the optimal makespan given full information. We refer to this ratio as the robustness factor. We give an algorithm with a robustness factor 2 - 1/m for the most general setting and improve this to 1.8 for equal-size jobs. For the special case of infinitesimal jobs, we give an algorithm with an optimal robustness f...
Robust scheduling aims at the construction of a schedule that is protected against uncertain events....
We study the problem of scheduling n given jobs on m uniform processors to minimize expected makespa...
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the proce...
The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be gro...
Algorithms with predictions is a recent framework that has been used to overcome pessimistic worst-c...
[EN] Many real-world problems are known as planning and scheduling problems, where resources must be...
The single machine scheduling problem with sum of completion times crite-rion (SS) can be solved eas...
International audienceMinimizing the weighted number of tardy jobs {on one machine} is a classical a...
Scheduling is a decision making process that concerns with allocation of limited resources (machines...
Abstract–A single-machine scheduling problem is investigated provided that the input data are uncert...
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, w...
AbstractThe robustness function of an optimization (minimization) problem measures the maximum incre...
Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as...
A single-machine scheduling problem is investigated provided that the input data are uncertain: The ...
We study popular local search and greedy algorithms for standard machine scheduling problems. The pe...
Robust scheduling aims at the construction of a schedule that is protected against uncertain events....
We study the problem of scheduling n given jobs on m uniform processors to minimize expected makespa...
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the proce...
The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be gro...
Algorithms with predictions is a recent framework that has been used to overcome pessimistic worst-c...
[EN] Many real-world problems are known as planning and scheduling problems, where resources must be...
The single machine scheduling problem with sum of completion times crite-rion (SS) can be solved eas...
International audienceMinimizing the weighted number of tardy jobs {on one machine} is a classical a...
Scheduling is a decision making process that concerns with allocation of limited resources (machines...
Abstract–A single-machine scheduling problem is investigated provided that the input data are uncert...
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, w...
AbstractThe robustness function of an optimization (minimization) problem measures the maximum incre...
Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as...
A single-machine scheduling problem is investigated provided that the input data are uncertain: The ...
We study popular local search and greedy algorithms for standard machine scheduling problems. The pe...
Robust scheduling aims at the construction of a schedule that is protected against uncertain events....
We study the problem of scheduling n given jobs on m uniform processors to minimize expected makespa...
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the proce...