908 search results - page 69 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
154
Voted
JAIR
2011
14 years 10 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
119
click to vote
DATE
2003
IEEE
15 years 8 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
108
Voted
SAC
2005
ACM
15 years 9 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
116
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...