Loading...

A GES/TS algorithm for the job shop scheduling

Nasiri, M. M ; Sharif University of Technology | 2012

860 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.cie.2011.12.018
  3. Publisher: 2012
  4. Abstract:
  5. The job shop scheduling problem is a difficult combinatorial optimization problem. This paper presents a hybrid algorithm which combines global equilibrium search, path relinking and tabu search to solve the job shop scheduling problem. The proposed algorithm used biased random sampling to have a better covering of the solution space. In addition, a new version of N6 neighborhood is applied in a tabu search framework. In order to evaluate the algorithm, comprehensive tests are applied to it using various standard benchmark sets. Computational results confirm the effectiveness of the algorithm and its high speed. Besides, 19 new upper bounds among the unsolved problems are found
  6. Keywords:
  7. Combinatorial optimization problems ; Computational results ; Global equilibrium search ; Hybrid algorithms ; Job shop ; Job shop scheduling problems ; Job-Shop scheduling ; Path relinking ; Random sampling ; Solution space ; Unsolved problems ; Upper Bound ; Algorithms ; Combinatorial optimization ; Scheduling ; Tabu search
  8. Source: Computers and Industrial Engineering ; Volume 62, Issue 4 , 2012 , Pages 946-952 ; 03608352 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0360835211003913