A.S. Jain and S. Meeran, "A state-of-the-art review of job-shop scheduling tech- niques," Technical Report, Department of Applied Physics, Electronics and Mechanical Engineering, University of Dundee, Scotland, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... intractable, that is, we can rarely ac complish optimal schedules within reasonable time for large problem instances [2] Hence, recent trend has shifted 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 ....

.... 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 technique to treat the job shop scheduling problem. In previous work [9] we concentrated on developing efficient deadlock removal heuristics which were incorporated into our GA. We proposed a ....

[Article contains additional citation context not shown here]

A.S. Jain and S. Meeran, "A state-of-the-art review of job-shop scheduling tech- niques," Technical Report, Department of Applied Physics, Electronics and Mechanical Engineering, University of Dundee, Scotland, 1998.

....search [27, 28, 37] simulated annealing [27, 38] tabu search [28,29,36] and genetic algorithms [12] Recently, Binato et al. 6] described a greedy randomized adaptive search procedure (GRASP) for the JSP. A comprehensive survey of job shop scheduling techniques can be found in Jain and Meeran [24]. In this paper, we present a new parallel GRASP with path relinking for the job shop scheduling problem. The remainder of the paper is organized as follows. In Section 2, we describe the new GRASP, describing two construction mechanisms and a local search algorithm. Path relinking for the JSP ....

A. S. Jain and S. Meeran. A state-of-the-art review of job-shop scheduling techniques. Technical report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland, 1998.

.... are given in [22, 26] These include dispatching rules reviewed in [15] the shifting bottleneck approach [1, 3] local search [26] simulated annealing [27] tabu search [25, 21] and genetic algorithms [9] A comprehensive survey of job shop scheduling techniques can be found in Jain and Meeran [18]. In this paper we present a greedy randomized adaptive search procedure (GRASP) for the job shop scheduling problem. The remainder of the paper is organized as follows. In Section 2, we make a brief review of the building blocks of GRASP. Section 3 focuses on a basic GRASP for the job shop ....

A. S. Jain and S. Meeran. A state-of-the-art review of job-shop scheduling techniques. Technical report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland, 1998.

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