14 search results - page 1 / 3 » Approximation algorithm for minimizing total latency in mach... |
102
Voted
DISOPT
2008
15 years 15 days ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
112
click to vote
MOR
2000
15 years 6 days ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
107
Voted
STOC
1996
ACM
15 years 4 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
114
click to vote
IPPS
2009
IEEE
15 years 7 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...
103
Voted
COR
2007
15 years 13 days ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...