Journal
PARALLEL COMPUTING
Volume 29, Issue 4, Pages 393-430Publisher
ELSEVIER
DOI: 10.1016/S0167-8191(03)00014-0
Keywords
combinatorial optimization; job shop scheduling; GRASP; path-relinking; probabilistic algorithm
Categories
Ask authors/readers for more resources
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. (C) 2003 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available