Please use this identifier to cite or link to this item:
|Title:||A fast tabu search algorithm for the group shop scheduling problem|
|Citation:||Liu, S.Q., Ong, H.L., Ng, K.M. (2005-08). A fast tabu search algorithm for the group shop scheduling problem. Advances in Engineering Software 36 (8) : 533-539. ScholarBank@NUS Repository. https://doi.org/10.1016/j.advengsoft.2005.02.002|
|Abstract:||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. © 2005 Elsevier Ltd. All rights reserved.|
|Source Title:||Advances in Engineering Software|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 11, 2018
WEB OF SCIENCETM
checked on Oct 31, 2018
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.