4 search results - page 1 / 1 » Study of an Iterative Technique to Minimize Completion Times... |
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...