200 search results - page 20 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
RTSS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
NCA
2007
IEEE
14 years 3 months ago
2007
IEEE
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
INFOCOM
2011
IEEE
13 years 16 days ago
2011
IEEE
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
AAAI
2000
13 years 10 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...