Photo by cokdewisnu from unsplash
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… Click to show full 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:
machine;
flow shop;
matheuristic algorithms;
total tardiness
Journal Title: Journal of Intelligent Manufacturing
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Intelligent Manufacturing
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!