Sciweavers

Share
252 search results - page 1 / 51
» An Experimental Study of Algorithms for Weighted Completion ...
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
8 years 7 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...
FSTTCS
2007
Springer
9 years 1 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of diļ¬€erent types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
8 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
MOR
2000
90views more  MOR 2000»
8 years 7 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
8 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
books