T. Yamada and R. Nakano, "Job-Shop Scheduling." Genetic Algorithms in Engineer- ing Systems, Chapter 7 (pp. 134-160) IEE control Engineering series 55, 1997  Home/Search   Document Details and Download   Summary   Related Articles

....towards approximation heuristics which seek approximate solutions in polynomial time instead of exact solution at intolerably high cost [26] Research on combinatorial optimization based on approximation algorithms is still very active. The emergence of meta heuristics such as genetic algorithms [3 9,15,16,28], simulated annealing [17 18] tabu search [19 21] and ant colony optimization [22 23] has activated this field. They can be regarded as problem independent approaches in the sense that they are not for specific optimization problems; but rather, they give general frameworks to design ....

....annealing [17 18] tabu search [19 21] and ant colony optimization [22 23] has activated this field. They can be regarded as problem independent approaches in the sense that they are not for specific optimization problems; but rather, they give general frameworks to design optimization problems [15]. Other heuristics include GRASP [2] the shifting bottleneck approach [11,24] and local search [18 19,25] A comprehensive survey of job shop scheduling techniques has been done by Jain and Meeran in [26] In this paper, we develop a genetic algorithm approach that employs a local search ....

[Article contains additional citation context not shown here]

T. Yamada and R. Nakano, "Job-Shop Scheduling." Genetic Algorithms in Engineer- ing Systems, Chapter 7 (pp. 134-160) IEE control Engineering series 55, 1997

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC