Sciweavers

155 search results - page 10 / 31
» Online Scheduling of Equal-Length Jobs on Parallel Machines
Sort
View
PPOPP
2006
ACM
15 years 5 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
105
Voted
IPPS
2009
IEEE
15 years 6 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
85
Voted
RANDOM
1999
Springer
15 years 3 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
IPL
2008
80views more  IPL 2008»
14 years 11 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
106
Voted
FUZZIEEE
2007
IEEE
15 years 3 months ago
Genetic Fuzzy Systems applied to Online Job Scheduling
Abstract-- This paper presents a comparison of three different design concepts for Genetic Fuzzy systems. We apply a Symbiotic Evolution that uses the Michigan approach and two app...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...