159 search results - page 15 / 32 » Machine Minimization for Scheduling Jobs with Interval Const... |
81
Voted
CLOUDCOM
2009
Springer
15 years 1 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
69
Voted
COR
2010
14 years 9 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
COCOON
2005
Springer
15 years 2 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
87
Voted
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...