Loading...

A tabu search algorithm for the stage shop problem

Nasiri, M. M ; Sharif University of Technology

654 Viewed
  1. Type of Document: Article
  2. DOI: 10.4028/www.scientific.net/AMR.433-440.3124
  3. Abstract:
  4. This paper presents stage shop problem which is a special case of the general shop. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective function, a tabu search algorithm is developed. In addition, an existing lower bound of the job shop is adapted to the new problem and the computational results have been compared to it. The proposed TS algorithm has reached the optimal solutions for about half of the problem instances
  5. Keywords:
  6. Stage shop ; Computational results ; General shop ; Job shop ; Lower bounds ; Makespan objective ; Mixed shops ; Optimal solutions ; Problem instances ; Tabu search algorithms ; Information technology ; Learning algorithms ; Materials science ; Scheduling ; Scheduling algorithms ; Tabu search
  7. Source: Advanced Materials Research, 16 September 2011 through 18 September 2011 ; Volume 433-440 , September , 2012 , Pages 3124-3129 ; 10226680 (ISSN) ; 9783037853191 (ISBN)
  8. URL: http://www.scientific.net/AMR.433-440.3124