A fast tabu search algorithm for the group shop scheduling problem

  • Authors:

  • S. Q. Liu;H. L. Ong;K. M. Ng

  • Affiliations:

  • Department of Industrial and Systems Engineering, National University of Singapore, Singapore, Singapore;Department of Industrial and Systems Engineering, National University of Singapore, Singapore, Singapore;Department of Industrial and Systems Engineering, National University of Singapore, Singapore, Singapore

  • Venue:
  • Advances in Engineering Software
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.