Sciweavers

720 search results - page 13 / 144
» Machine scheduling with resource dependent processing times
Sort
View
JCO
2010
87views more  JCO 2010»
14 years 6 months ago
On-line machine scheduling with batch setups
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
Lele Zhang, Andrew Wirth
ANOR
2008
96views more  ANOR 2008»
14 years 12 months ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual
ICML
2010
IEEE
15 years 23 days ago
Forgetting Counts: Constant Memory Inference for a Dependent Hierarchical Pitman-Yor Process
We propose a novel dependent hierarchical Pitman-Yor process model for discrete data. An incremental Monte Carlo inference procedure for this model is developed. We show that infe...
Nicholas Bartlett, David Pfau, Frank Wood
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 11 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
PLDI
1996
ACM
15 years 3 months ago
A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
Alexandre E. Eichenberger, Edward S. Davidson