874 search results - page 107 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
ICPADS
1998
IEEE
15 years 2 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
100
click to vote
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...