Add to ORKGWe consider the problem of running a job on a selected machine of a collection of machines. Each of these machines may become temporarily unavailable (busy) without warning, in which case the scheduler is allowed to restart the job on a different machine. The behaviour of machines is characterized by a Markov chain, and objective is to minimize completion time of the job. For several types of Markov chains, we present optimal policies
This paper addresses a job scheduling problem on multiple identical parallel machines so as to minim...
In this work, we study the problem of machine scheduling n jobs with setups. This means that the exe...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...
We consider the problem of running a job on a selected machine of a collection of machines. Each of ...
We consider the problem of running a background job on a selected machine of a collection of machine...
The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study t...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
This note deals with the scheduling problem of maximizing the number of early jobs on a single machi...
This note deals with the scheduling problem of maximizing the number of early jobs on a single machi...
We study the scheduling problem of minimizing the maximum starting time on-line. The goal is to mini...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
Effective and efficient scheduling in a dynamically changing environment is important for real-time ...
We consider the problem of scheduling jobs online, where jobs may be served partially in order to op...
This paper addresses a job scheduling problem on multiple identical parallel machines so as to minim...
In this work, we study the problem of machine scheduling n jobs with setups. This means that the exe...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...
We consider the problem of running a job on a selected machine of a collection of machines. Each of ...
We consider the problem of running a background job on a selected machine of a collection of machine...
The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study t...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
This note deals with the scheduling problem of maximizing the number of early jobs on a single machi...
This note deals with the scheduling problem of maximizing the number of early jobs on a single machi...
We study the scheduling problem of minimizing the maximum starting time on-line. The goal is to mini...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
Effective and efficient scheduling in a dynamically changing environment is important for real-time ...
We consider the problem of scheduling jobs online, where jobs may be served partially in order to op...
This paper addresses a job scheduling problem on multiple identical parallel machines so as to minim...
In this work, we study the problem of machine scheduling n jobs with setups. This means that the exe...
We investigate the problem of on-line scheduling two-machine open shops with the objective of minimi...