Sciweavers

35 search results - page 5 / 7
» Minimizing the makespan for Unrelated Parallel Machines
Sort
View
WSC
2008
13 years 7 months ago
Maximizing the utilization of operating rooms with stochastic times using simulation
This paper addresses a surgery rooms scheduling problem. The problem is modeled as a parallel machine scheduling problem with sequence dependent setup times and an objective of mi...
Jean-Paul M. Arnaout, Sevag Kulbashian
BIRTHDAY
2009
Springer
13 years 9 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
13 years 9 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 5 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...
IPPS
2008
IEEE
13 years 11 months ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...