Sciweavers

47 search results - page 2 / 10
» Parallel machine scheduling with precedence constraints and ...
Sort
View
ICALP
2001
Springer
13 years 9 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
COR
2007
121views more  COR 2007»
13 years 4 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
2002
105views more  EOR 2002»
13 years 4 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
CLOUDCOM
2009
Springer
13 years 8 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 4 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...