614 search results - page 55 / 123 » Resource Minimization Job Scheduling |
142
Voted
STOC
1996
ACM
15 years 8 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...
130
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
139
Voted
DSD
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract. Network-on-chip-based multiprocessor systems-onchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel p...
146
click to vote
COR
2007
15 years 3 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
152
click to vote
CONSTRAINTS
2006
15 years 4 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...