Sciweavers

159 search results - page 3 / 32
» Machine Minimization for Scheduling Jobs with Interval Const...
Sort
View
DISOPT
2008
118views more  DISOPT 2008»
13 years 10 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
JSSPP
2009
Springer
14 years 4 months ago
Scalability Analysis of Job Scheduling Using Virtual Nodes
It is important to identify scalability constraints in existing job scheduling software as they are applied to next generation parallel systems. In this paper, we analyze the scala...
Norman Bobroff, Richard Coppinger, Liana Fong, See...
COR
2007
121views more  COR 2007»
13 years 9 months ago
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
Xiuli Wang, T. C. Edwin Cheng
EOR
2010
104views more  EOR 2010»
13 years 7 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 10 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...