Sciweavers

114 search results - page 9 / 23
» On the Robust Single Machine Scheduling Problem
Sort
View
IPCO
2004
142views Optimization» more  IPCO 2004»
13 years 8 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
ATAL
2009
Springer
14 years 2 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 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
14 years 1 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit