159 search results - page 11 / 32 » Machine Minimization for Scheduling Jobs with Interval Const... |
102
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
ECCC
2000
14 years 9 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ESA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
125
click to vote
WAOA
2010
Springer
14 years 7 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
CSCLP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...