200 search results - page 13 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
173
click to vote
IFIPTCS
2010
15 years 1 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
117
click to vote
ICTCS
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
142
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
154
click to vote
AAIM
2007
Springer
15 years 9 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 ...
163
click to vote
CONSTRAINTS
2011
14 years 10 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...