412 search results - page 6 / 83 » Parallel Machine Scheduling Problems with Controllable Proce... |
WAOA
2004
Springer
14 years 1 days ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
EUSFLAT
2003
13 years 8 months ago
2003
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...
COR
2010
13 years 6 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Predictable network computing still involves a number of open questions. One such question is providing a controlled amount of CPU time to distributed processes. Mechanisms to cont...