Daftar Isi:
  • Hybrid flowshop scheduling is one topic that is often reviewed by researchers at this time. This article aims to discuss the issue of three stage hybrid flowshop scheduling to minimize makespan. A new algorithm is proposed for this problem. The proposed algorithm is developed from the Pour heuristic algorithm. Several experiments were conducted to determine the performance of the proposed algorithm. The results of numerical experiments resulted in the proposed algorithm having better performance compared to some algorithms.