200 search results - page 13 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
IFIPTCS
2010
13 years 6 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...
ICTCS
2003
Springer
14 years 2 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...
IPPS
2009
IEEE
14 years 3 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...
AAIM
2007
Springer
14 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 ...
CONSTRAINTS
2011
13 years 3 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...