Loading...

A hybrid scatter search for the partial job shop scheduling problem

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

1030 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00170-010-2792-2
  3. Publisher: 2011
  4. Abstract:
  5. This paper presents a special case of the general shop called partial job shop problem. The partial job shop is a more realistic generalization of the mixed shop problem. The problem is formulated as a mixed integer programming model. A scatter search algorithm combined with tabu search and path relinking is used to tackle this problem with makespan criterion. The computational experiments are performed on some problem instances. The results are compared with a lower bound and the effectiveness of the algorithm is shown
  6. Keywords:
  7. Scheduling ; Computational experiment ; General shop ; Job shop ; Job shop problem ; Job shop scheduling problems ; Lower bounds ; Makespan criterion ; Mixed integer programming model ; Mixed shops ; Partial job shop ; Path relinking ; Problem instances ; Scatter search ; Scatter search algorithm ; Integer programming ; Machine shops ; Scheduling algorithms ; Tabu search
  8. Source: International Journal of Advanced Manufacturing Technology ; Volume 52, Issue 9-12 , February , 2011 , Pages 1031-1038 ; 02683768 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs00170-010-2792-2