A fast tabu search algorithm for the group shop scheduling problem
Liu, Shi Qiang, Ong, Hoon Liong, & Ng, Kien Ming (2005) A fast tabu search algorithm for the group shop scheduling problem. Advances in Engineering Software, 36(8), pp. 533-539.
Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Keywords:||Machine scheduling, Flow shop, Open shop, Job shop, Mixed shop, Group shop|
|ISSN:||1873-5339 (online) 0965-9978 (print)|
|Divisions:||Current > Schools > School of Mathematical Sciences
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2005 Elsevier Ltd.|
|Deposited On:||16 Feb 2012 22:31|
|Last Modified:||30 Apr 2014 06:28|
Repository Staff Only: item control page