Results 1  10
of
170,200
Preemptive Scheduling of Identical Machines
, 2000
"... We study the scheduling situation where jobs, subject to duedates or deadlines, have to be preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the optimum value of Lmax , the maximal lateness. We show that it can be computed in O(n log n), hence improv ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We study the scheduling situation where jobs, subject to duedates or deadlines, have to be preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the optimum value of Lmax , the maximal lateness. We show that it can be computed in O(n log n), hence
Sequential Scheduling on Identical Machines
, 2014
"... We study a sequential version of the wellknown KPmodel: Each of n agents has a job that needs to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the finish time of his machine. We study the corresponding seque ..."
Abstract
 Add to MetaCart
sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insights into the case of two unrelated machines. Keywords: sequential price of anarchy, machine scheduling, congestion games, load balancing, subgameperfect equilibrium, makespan minimization. 1
Heuristics for Scheduling on Restricted Identical Machines
"... Abstract—In this paper we propose a simple efficient algorithm for the problem of job scheduling on restricted identical machines, with the objective of minimizing makespan. This problem is a special case of R   Cmax, where a job can only be assigned to a subset of machines. The algorithm runs in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—In this paper we propose a simple efficient algorithm for the problem of job scheduling on restricted identical machines, with the objective of minimizing makespan. This problem is a special case of R   Cmax, where a job can only be assigned to a subset of machines. The algorithm runs
Sparse Bayesian Learning and the Relevance Vector Machine
, 2001
"... This paper introduces a general Bayesian framework for obtaining sparse solutions to regression and classification tasks utilising models linear in the parameters. Although this framework is fully general, we illustrate our approach with a particular specialisation that we denote the `relevance vect ..."
Abstract

Cited by 966 (5 self)
 Add to MetaCart
vector machine’ (RVM), a model of identical functional form to the popular and stateoftheart `support vector machine ’ (SVM). We demonstrate that by exploiting a probabilistic Bayesian learning framework, we can derive accurate prediction models which typically utilise dramatically fewer basis
Scheduling on identical machines: How good is
 Operations Research Letters
, 1997
"... . We consider a parallel machine scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on m identical machines, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We consider a parallel machine scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on m identical machines, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known
Online Scheduling on Identical Machines using SRPT
"... Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemainingProcessingTime (SRPT) appears to be the most natural algorithm to consider for the problem of minimizing average flow time on multiple identical machines. It is known that SRPT achieves the ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemainingProcessingTime (SRPT) appears to be the most natural algorithm to consider for the problem of minimizing average flow time on multiple identical machines. It is known that SRPT achieves
AllNorm Approximation for Scheduling on Identical Machines
 In Scandinavian Workshop on Algorithms Theory (SWAT
, 2004
"... We consider the problem of assigning jobs to m identical machines. The load of a machine is the sum of the weights of jobs assigned to it. The goal is to minimize the norm of the resulting load vector. It is known that for any xed norm there is a PTAS. On the other hand, it is also known that th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider the problem of assigning jobs to m identical machines. The load of a machine is the sum of the weights of jobs assigned to it. The goal is to minimize the norm of the resulting load vector. It is known that for any xed norm there is a PTAS. On the other hand, it is also known
AllNorm Approximation for Scheduling on Identical Machines
"... Abstract We consider the problem of assigning jobs to m identical machines. The load of a machine is the sum of the weights of jobs assigned to it. The goal is to minimize the norm of the resulting load vector. It is known that for any fixed norm there is a PTAS. On the other hand, it is also known ..."
Abstract
 Add to MetaCart
Abstract We consider the problem of assigning jobs to m identical machines. The load of a machine is the sum of the weights of jobs assigned to it. The goal is to minimize the norm of the resulting load vector. It is known that for any fixed norm there is a PTAS. On the other hand, it is also known
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 491 (34 self)
 Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying
Conditional Hardness of Precedence Constrained Scheduling on Identical Machines
, 2009
"... Already in 1966, Graham showed that a simple procedure called list scheduling yields a 2approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. Till this date it has remained the best algorithm and whether it can or canno ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Already in 1966, Graham showed that a simple procedure called list scheduling yields a 2approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. Till this date it has remained the best algorithm and whether it can
Results 1  10
of
170,200