Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also examples exist where preemptions do not improve the performance. This paper gives an overview of existing and new results on this topic for single and parallel machine scheduling problems
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel mach...
In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we comp...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
Although theoretical results have been established regarding the utility of pre-emptive scheduling i...
Consider some preemptive scheduling problem, i.e., a problem where we can inter-rupt operations and ...
It is well known that on-line preemptive scheduling algorithms can achieve efficient performance, A ...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
International audienceWe consider preemptive machine scheduling problems on identical parallel machi...
The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set o...
University of Technology Sydney. Faculty of Science.This work examines in depth a collection of rela...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
We address a class of single-machine, hard scheduling problemswith the objective of minimizing the m...
Jeff Edmonds y Donald D. Chinn y Tim Brecht y Xiaotie Deng y Department of Computer Science Y...
We consider a single machine earliness/tardiness scheduling problem with general weights, ready time...
We address a class of single-machine, hard scheduling problems with the objective of minimizing the ...
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel mach...
In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we comp...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
Although theoretical results have been established regarding the utility of pre-emptive scheduling i...
Consider some preemptive scheduling problem, i.e., a problem where we can inter-rupt operations and ...
It is well known that on-line preemptive scheduling algorithms can achieve efficient performance, A ...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
International audienceWe consider preemptive machine scheduling problems on identical parallel machi...
The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set o...
University of Technology Sydney. Faculty of Science.This work examines in depth a collection of rela...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
We address a class of single-machine, hard scheduling problemswith the objective of minimizing the m...
Jeff Edmonds y Donald D. Chinn y Tim Brecht y Xiaotie Deng y Department of Computer Science Y...
We consider a single machine earliness/tardiness scheduling problem with general weights, ready time...
We address a class of single-machine, hard scheduling problems with the objective of minimizing the ...
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel mach...
In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we comp...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...