Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem

Quang Chieu Ta (), Jean-Charles Billaut () and Jean-Louis Bouquard ()
Additional contact information
Quang Chieu Ta: Université François Rabelais de Tours
Jean-Charles Billaut: Université François Rabelais de Tours
Jean-Louis Bouquard: Université François Rabelais de Tours

Journal of Intelligent Manufacturing, 2018, vol. 29, issue 3, No 11, 617-628

Abstract: Abstract We consider in this paper the m-machine permutation flow-shop problem with total tardiness minimization. We propose several matheuristic algorithms, which are an hybridization of a local search and an exact resolution method. The matheuristics are compared to a genetic algorithm. Computational experiments are performed on benchmark instances and the results show the good performances of the matheuristic algorithms. Finally, some future research directions are given.

Keywords: Scheduling; Flow-shop; Matheuristic; Genetic algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10845-015-1046-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joinma:v:29:y:2018:i:3:d:10.1007_s10845-015-1046-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10845

DOI: 10.1007/s10845-015-1046-4

Access Statistics for this article

Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak

More articles in Journal of Intelligent Manufacturing from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().