Archives
 
Special Issues
 
Vol 58, Issue 5, [10 - 2017]

Study of Matheuristic algorithm for minimizing total tardiness in the m-machine flow-shop scheduling problem

https://tapchi.humg.edu.vn/en/archives?article=1135

  • Affiliations:

    Khoa Công nghệ Thông tin, Trường đại học Mỏ - Địa chất, Việt Nam

  • *Corresponding:
    This email address is being protected from spambots. You need JavaScript enabled to view it.
  • Received: 20th-June-2017
  • Revised: 26th-July-2017
  • Accepted: 30th-Oct-2017
  • Online: 30th-Oct-2017
Views: 1956
View onlineView online
Downloads: 605
Downdload PDF
★★★★★Rating: 1.0, Total rating: 60
  • ★
  • ★
  • ★
  • ★
  • ★
Yours rating

Abstract:

In this paper, we consider m-machine permutation flow shop problem with total tardiness minimization. We propose neighbor operators and matheuristic algorithm. Mathueristic are an hybridization of a local search and an exact resolution method. The matheuristic is compared to a genetic algorithm. Computational experiments are performed on benchmark instances and the results show the good performances of the matheuristic algorithm. Finally, some future research directions are proposed.

How to Cite
Ta, C.Quang 2017. Study of Matheuristic algorithm for minimizing total tardiness in the m-machine flow-shop scheduling problem (in Vietnamese). Journal of Mining and Earth Sciences. 58, 5 (Oct, 2017).

Other articles