200 search results - page 27 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
RTSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Energy reduction is critical to increase the mobility and to extend the mission period in the development of today’s pervasive computing systems. On the other hand, however, ene...
APPROX
2006
Springer
14 years 17 days ago
2006
Springer
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...
ESA
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
ANOR
2005
13 years 8 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...