Sciweavers

173 search results - page 12 / 35
» Special Cases of Online Parallel Job Scheduling
Sort
View
EOR
2007
103views more  EOR 2007»
13 years 7 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
PPOPP
2006
ACM
14 years 1 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
EUSFLAT
2003
13 years 9 months ago
Minimisation of the expected weighted number of jobs being late with fuzzy processing time in a one machine system
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...
Barbara Gladysz, Dorota Kuchta
DISOPT
2008
89views more  DISOPT 2008»
13 years 7 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
COR
2011
13 years 2 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diï¬...
Luis Fanjul-Peyro, Rubén Ruiz