Solving group flexible flow-shop problems by the PT algorithm

  • Authors:

  • Tzung-Pei Hong;Pei-Ying Huang;Gwoboa Horng;Cheng-Yan Kao

  • Affiliations:

  • Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

  • Venue:
  • MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a heuristic algorithm to solve group flexible flow-shop problems with more than two machine centers, which have the same number of parallel machines. The proposed algorithm first determines the job sequencing in each group by combining both the LPT and the PT approaches to solve the flexible flow-shop problems of more than two machine centers. It then determines the group sequence by the PT approach. Experiments are made to compare the performance of the proposed algorithm with the optimal one by dynamic programming. The results show that the optimal approach can solve the problem with only a very limited size. The proposed approach can, however, quickly obtain the approximate results, with much less computation costs than that by the optimal algorithm. A trade-off can be easily achieved between accuracy and time complexity.