Loading...

A new neighborhood for the job shop scheduling problem

Nasiri, M. M ; Sharif University of Technology

634 Viewed
  1. Type of Document: Article
  2. DOI: 10.4028/www.scientific.net/AMR.433-440.1540
  3. Abstract:
  4. The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts
  5. Keywords:
  6. Stage shop ; Computational effort ; General shop ; Job shop scheduling problems ; Local search algorithm ; Mixed shops ; Neighborhood structure ; New solutions ; Shop scheduling ; Information technology ; Learning algorithms ; Machine shops ; 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 1540-1544 ; 10226680 (ISSN) ; 9783037853191 (ISBN)
  8. URL: http://www.scientific.net/AMR.433-440.1540