1095 search results - page 51 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
164
click to vote
JCST
2010
14 years 11 months ago
2010
Abstract Workflows are prevailing in scientific computation. Multicluster environments emerge and provide more resources, benefiting workflows but also challenging the traditional ...
134
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
133
Voted
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
144
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
134
click to vote
MASCOTS
2003
15 years 5 months ago
2003
Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities a...