62 search results - page 8 / 13 » Intelligent Backtracking Techniques for Job Shop Scheduling |
IPCO
1998
13 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
IEAAIE
2005
Springer
14 years 6 days ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
WSC
2001
13 years 8 months ago
2001
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
ICCSA
2004
Springer
14 years 2 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...