Parallel GRASP with path-relinking for job shop scheduling

Authors:
R. M. Aiex;S. Binato;M. G. C. Resende
Affiliations:
Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22451, Brazil;Electrical Energy Research Center (CEPEL), P.O. Box 68007, Rio de Yaneiro RJ 21944-970, Brazil;AT&T Labs Research, Internet and Network Systems Research Center, 180 Park Avenue, Room C241, Florham Park, NJ
Venue:
Parallel Computing - Special issue: Parallel computing in numerical optimization
Year:
2003

Citing 11
Cited 28

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem

Annals of Operations Research
Job shop scheduling by simulated annealing

Operations Research
A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A fast taboo search algorithm for the job shop problem

Management Science
MPI: The Complete Reference

MPI: The Complete Reference
Tabu Search

Tabu Search
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing

Nonlinear optimization and parallel computing

Parallel Computing - Special issue: Parallel computing in numerical optimization
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Path relinking for the vehicle routing problem

Journal of Heuristics
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
Genetic multi-step search in interpolation and extrapolation domain

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Ant colony optimization combined with taboo search for the job shop scheduling problem

Computers and Operations Research
A greedy randomized adaptive search procedure for the point-feature cartographic label placement

Computers & Geosciences
Metaheuristic Agent Teams for Job Shop Scheduling Problems

HoloMAS '07 Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
A grasp-knapsack hybrid for a nurse-scheduling problem

Journal of Heuristics
An optimization approach for the job shop scheduling problem

MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
A GRASP and branch-and-bound metaheuristic for the job-shop scheduling

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

Applied Soft Computing
Complex scheduling problems using an optimization methodology

WSEAS Transactions on Information Science and Applications
Solving job shop scheduling problems utilizing the properties of backbone and "big valley"

Computational Optimization and Applications
Testing the permutation space based geometric differential evolution on the job-shop scheduling problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
GRASP with path-relinking for data clustering: a case study for biological data

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
A GRASP approach for makespan minimization on parallel batch processing machines

Journal of Intelligent Manufacturing
Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics
GRASP with path-relinking for the generalized quadratic assignment problem

Journal of Heuristics
Comparative experiments with GRASP and constraint programming for the oil well drilling problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
GRASP with path-relinking for the weighted maximum satisfiability problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A variable neighbourhood search algorithm for job shop scheduling problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
A hybrid Differential Evolution-Tabu Search algorithm for the solution of Job-Shop Scheduling Problems

Applied Soft Computing
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps

Computers and Operations Research
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Community detection by modularity maximization using GRASP with path relinking

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines under certain constraints, such that the maximum completion time of the jobs is minimized. In this paper, we describe a parallel greedy randomized adaptive search procedure (GRASP) with path-relinking for the JSP. 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 good-quality approximate solutions of the JSP.