## Parallel Grasp With Path-Relinking For Job Shop Scheduling (2002)

### Cached

### Download Links

- [www.research.att.com]
- [www2.research.att.com]
- [www.optimization-online.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Parallel Computing |

Citations: | 35 - 18 self |

### BibTeX

@ARTICLE{Aiex02parallelgrasp,

author = {R. M. Aiex and S. Binato and M. G. C. Resende},

title = {Parallel Grasp With Path-Relinking For Job Shop Scheduling},

journal = {Parallel Computing},

year = {2002},

volume = {29},

pages = {2003}

}

### Years of Citing Articles

### OpenURL

### Abstract

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation is processed on a specific machine for a fixed duration. A machine can process no more than one job at a time and once a job initiates processing on a given machine it must complete processing without interruption. A schedule is an assignment of operations to time slots on the machines. The objective of the JSP is to find a schedule that minimizes the maximum completion time, or makespan, of the jobs. In this paper, we describe a parallel greedy randomized adaptive search procedure (GRASP) with path-relinking for the JSP. A GRASP is a metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path-relinking is an intensification strategy that explores trajectories that connect high quality solutions. Independent and cooperative parallelization strategies are described and implemented. Computational experience on a large set of standard test problems indicates that the parallel GRASP with path-relinking finds goodquality approximate solutions of the job shop scheduling problem.

### Citations

519 | Greedy Randomized Adaptive Search Procedures - Resende, Ribeiro |

350 |
Graphical Methods for Data Analysis
- Chambers, Cleveland, et al.
- 1983
(Show Context)
Citation Context ...at, given a target solution value, the time it takes GRASP to find a solution at least as good as the target fits a two-parameter exponential distribution. Standard methodology for graphical analysis =-=[11]-=- was used to compute the empirical and theoretical distributions and to estimate the parameters of the distributions. We use the same methodology to study time to target value for GRASP and GP+PR. Our... |

294 |
OR-Library: Distributing test problems by electronic mail
- Beasley
- 1990
(Show Context)
Citation Context ...ses of standard JSP test problems: abz, car, la, mt, and orb. The problem dimensions vary from 6 to 30 jobs and from 4 to 20 machines. All instances tested were downloaded from Beasley’s OR-Library =-=1 [5]-=-. 5.3. The sequential experiments. The goal of the sequential experiments was to observe the general behavior of the implementations of the proposed algorithms. In these experiments, we present result... |

188 |
The shifting bottleneck procedure for Job Shop Scheduling
- Adams, Balas, et al.
- 1988
(Show Context)
Citation Context ...or such problems there is a need for good heuristics. Surveys of heuristic methods for the JSP are given in [30,37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach =-=[1, 4]-=-, local 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 (GRA... |

175 |
A computational study of the job-shop scheduling problem
- Applegate, Cook
- 1991
(Show Context)
Citation Context ... the objective of the JSP is to find, among the feasible permutations, the one with the smallest makespan. The JSP is NP-hard [26] and has also proven to be computationally challenging. Exact methods =-=[4, 7, 9, 10, 19] h-=-ave been successful in solving small instances, including the notorious 10 × 10 instance of Fisher and Thompson [16], proposed in 1963 and only solved twenty years later. Problems of dimension 15 × ... |

154 | A probabilistic heuristic for a computationally difficult set covering problem - Feo, Resende - 1989 |

138 |
An algorithm for solving the job-shop problem
- Carlier, Pinson
- 1989
(Show Context)
Citation Context ... the objective of the JSP is to find, among the feasible permutations, the one with the smallest makespan. The JSP is NP-hard [26] and has also proven to be computationally challenging. Exact methods =-=[4, 7, 9, 10, 19] h-=-ave been successful in solving small instances, including the notorious 10 × 10 instance of Fisher and Thompson [16], proposed in 1963 and only solved twenty years later. Problems of dimension 15 × ... |

136 |
A fast taboo search algorithm for the job-shop problem
- Nowicki, Smutnicki
- 1996
(Show Context)
Citation Context ...thods for the JSP are given in [30,37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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 ... |

121 |
Job Shop Scheduling with Genetic Algorithms
- Davis
- 1985
(Show Context)
Citation Context ...37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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]... |

121 |
Probabilistic learning combinations of local job-shop scheduling rules
- Fisher, Thompson
- 1963
(Show Context)
Citation Context ...and has also proven to be computationally challenging. Exact methods [4, 7, 9, 10, 19] have been successful in solving small instances, including the notorious 10 × 10 instance of Fisher and Thompson=-= [16], p-=-roposed in 1963 and only solved twenty years later. Problems of dimension 15 × 15 are still considered to be beyond the reach of today’s exact methods. For such problems there is a need for good he... |

108 | Tabu Search and Adaptive Memory Programming – Advances, Applications and Challenges
- Glover
- 1996
(Show Context)
Citation Context ...PAN(Sbest) ≤ look4 then return (Sbest) fi; 23 rof; 24 POST OPTIMIZATION(P ); 25 Sbest = POOLMIN(P ); 26 return (Sbest); end GRASP PR; Figure 2. GRASP with bidirectional path-relinking for JSP. Glove=-=r [20] a-=-s an intensification strategy exploring trajectories connecting elite solutions obtained by tabu search or scatter search [21–23]. The use of path-relinking within a GRASP procedure, as an intensifi... |

107 | Fundamentals of scatter search and path relinking - GLOVER, LAGUNA, et al. - 2000 |

94 |
A practical use of Jackson’s preemptive schedule for solving the Job-Shop problem
- Carlier, Pinson
- 1990
(Show Context)
Citation Context ... the objective of the JSP is to find, among the feasible permutations, the one with the smallest makespan. The JSP is NP-hard [26] and has also proven to be computationally challenging. Exact methods =-=[4, 7, 9, 10, 19] h-=-ave been successful in solving small instances, including the notorious 10 × 10 instance of Fisher and Thompson [16], proposed in 1963 and only solved twenty years later. Problems of dimension 15 × ... |

92 | GRASP and path relinking for 2-layer straight line crossing minimization
- LAGUNA, R
- 1999
(Show Context)
Citation Context ...u search or scatter search [21–23]. The use of path-relinking within a GRASP procedure, as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Mart=-=í [25]-=-. It was followed by several extensions, improvements, and successful applications [2, 8, 31, 33]. In this section, we propose a path-relinking strategy for the JSP. In our description, a schedule is ... |

83 |
MPI—The Complete Reference: Volume 1, The MPI Core, 2nd edition
- Snir, Otto, et al.
- 1998
(Show Context)
Citation Context ...piled with the SGI MIPSpro F77 compiler using flags -O3 -r4 -64. The Message-Passing Interface (MPI) specification has become a common standard for message-passing libraries for parallel computations =-=[35]. -=-The parallel codes used SGI’s Message Passing Toolkit 1.4, which contains a fully compliant implementation of the MPI 1.2 specification. CPU times for the sequential implementation were measured wit... |

80 | GRASP: An annotated bibliography - Festa, Resende - 2002 |

77 |
Algorithms for solving production scheduling problems
- Giffler, Thompson
- 1960
(Show Context)
Citation Context |

76 |
Job Shop Scheduling by Simulated Annealing
- LAARHOVEN, AARTS, et al.
- 1992
(Show Context)
Citation Context ...urveys of heuristic methods for the JSP are given in [30,37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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 sched... |

74 | A branch and bound algorithm for the job shop scheduling problem - Brucker, Jurisch, et al. - 1994 |

72 |
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Taillard
- 1994
(Show Context)
Citation Context ... completion. Once the permutation of J is given, its feasibility status can be determined in O(|J | · |M|) time. The feasibility-checking procedure determines the makespan Cmax for feasible schedules=-= [36]-=-. Since, each set of feasible permutations has a corresponding schedule, the objective of the JSP is to find, among the feasible permutations, the one with the smallest makespan. The JSP is NP-hard [2... |

53 | Job shop scheduling by local search - Vaessens, Aarts, et al. - 1996 |

49 | GRASP with path-relinking for three-index assignment
- Aiex, Pardalos, et al.
(Show Context)
Citation Context ... as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Martí [25]. It was followed by several extensions, improvements, and successful applications=-= [2, 8, 31, 33]-=-. In this section, we propose a path-relinking strategy for the JSP. In our description, a schedule is represented by the permutation of operations in J on the machines in M. The schedule is represent... |

48 | Probability distribution of solution time in GRASP: An experimental investigation
- Aiex, Resende, et al.
(Show Context)
Citation Context ...OP SCHEDULING 27 The most difficult class was abz, where the average relative error with respect to the BKS achieved 2.64%. 5.4. Probability distribution for solution time. Aiex, Resende, and Ribeiro =-=[3]-=- studied the empirical probability distributions of the random variable time to target solution in five GRASP implementations. They showed that, given a target solution value, the time it takes GRASP ... |

47 | Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Canuto, Resende, et al.
(Show Context)
Citation Context ... as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Martí [25]. It was followed by several extensions, improvements, and successful applications=-= [2, 8, 31, 33]-=-. In this section, we propose a path-relinking strategy for the JSP. In our description, a schedule is represented by the permutation of operations in J on the machines in M. The schedule is represent... |

43 |
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
- Fleurent, Glover
- 1999
(Show Context)
Citation Context ...e to GRASP solution sg, or in both directions. These two trajectories very often visit different intermediate solutions. The hybrid strategy proposed uses an approach developed by Fleurent and Glover =-=[17]-=- to incorporate elite solutions to a GRASP. Let cbest and cworst be the values of the objective functions of the best and the worst solution in P , respectively. Given two solutions S = {(j S 1,1 , jS... |

39 |
Les problèmes d’ordonnancement avec contraintes disjonctives
- Roy, Sussmann
- 1964
(Show Context)
Citation Context ...he construction phase is optimal, local search should be applied to attempt to decrease its makespan. We employ the two exchange local search, based on the disjunctive graph model of Roy and Sussmann =-=[34], an-=-d used in Binato et al. [6]. The disjunctive graph G = (V, A, E) is defined such that V = {O ∪ {0, |J | · |M| + 1}} is the set of nodes, where {0} and {|J | · |M| + 1} are artificial source and si... |

34 | A hybrid GRASP with perturbations for the Steiner problem in graphs
- Ribeiro, Uchoa, et al.
(Show Context)
Citation Context ... as an intensification strategy applied to each locally optimal solution, was first proposed by Laguna and Martí [25]. It was followed by several extensions, improvements, and successful applications=-= [2, 8, 31, 33]-=-. In this section, we propose a path-relinking strategy for the JSP. In our description, a schedule is represented by the permutation of operations in J on the machines in M. The schedule is represent... |

31 | Multi-Start Strategic Oscillation Methods – Principles to Exploit Adaptive Memory”, in Computing tools for modeling, Optimization and Simulation - Glover - 2000 |

30 |
Parallel Local Search
- Verhoeven, Aarts
- 1995
(Show Context)
Citation Context ...lue 943. 4.1. Non-collaborative scheme. We revisit a basic parallelization scheme for GRASP with path-relinking proposed in [2]. Figure 15 shows pseudo-code for this multiple independent walks scheme =-=[39]-=-. Our implementation uses message passing for communication between processors. This communication is limited to program initialization and termination. A single process reads the problem data and pas... |

24 | A state-of-the-art review of job-shop scheduling techniques
- Jain, Meeran
- 1998
(Show Context)
Citation Context ...[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, d... |

24 | Combining the Large-Step Optimization with Tabu Search: Application to the Job Shop Scheduling
- Lourenco, Zwijnenburg
- 1996
(Show Context)
Citation Context ...e is a need for good heuristics. Surveys of heuristic methods for the JSP are given in [30,37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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 comprehe... |

17 | A GRASP for Job Shop Scheduling
- Binato, Hery, et al.
- 2000
(Show Context)
Citation Context ... rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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... |

16 |
The job shop scheduling problem: A concise survey and some recent developments
- Pinson
- 1995
(Show Context)
Citation Context ...of dimension 15 × 15 are still considered to be beyond the reach of today’s exact methods. For such problems there is a need for good heuristics. Surveys of heuristic methods for the JSP are given =-=in [30,37]-=-. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local search [27, 28, 37], simulated annealing [27, 38], tabu search [28,29,36], and genetic algorithms [12... |

12 |
Rinnooy Kan. Computational complexity of discrete optimization problems
- Lenstra, G
- 1979
(Show Context)
Citation Context ...6]. Since, each set of feasible permutations has a corresponding schedule, the objective of the JSP is to find, among the feasible permutations, the one with the smallest makespan. The JSP is NP-hard =-=[26] -=-and has also proven to be computationally challenging. Exact methods [4, 7, 9, 10, 19] have been successful in solving small instances, including the notorious 10 × 10 instance of Fisher and Thompson... |

8 |
2001) “A GRASP with path relinking for permanent virtual circuit routing”, Research Report, submitted for publication
- Resende, Ribeiro
(Show Context)
Citation Context |

5 | Local optimization and the job-shop scheduling problem
- Lourenço
- 1995
(Show Context)
Citation Context ...e is a need for good heuristics. Surveys of heuristic methods for the JSP are given in [30,37]. These include dispatching rules reviewed in [18], the shifting bottleneck approach [1, 4], local 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 comprehe... |

4 |
Sequencing and Scheduling:An Introduction to the Mathematics
- French
- 1982
(Show Context)
Citation Context ...d the reach of today’s exact methods. For such problems there is a need for good heuristics. Surveys of heuristic methods for the JSP are given in [30,37]. These include dispatching rules reviewed i=-=n [18]-=-, the shifting bottleneck approach [1, 4], local 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 ... |