2018•International Journal of Sciences: Basic and Applied ResearchOpen access

Minimizing Total Tardiness in the m-Machine Flow-Shop Problem by Heuristic Algorithms

Quang Chieu Ta

Abstract

In this work the m-machine permutation flow-shop problem has been considered. The permutation flow-shop scheduling problem where a set of jobs have to be scheduled on a set of machines in the same order. We propose heuristic algorithms for the flow-shop problem to minimizing the total tardiness. A new genetic and Tabu search algorithm which initialized by the solution of EDD, NEH and EN algorithm. Computational experiments are performed on benchmark instances and the results show the good performances of these methods. Finally, some future research directions are given.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tardiness, Flow shop scheduling, Tabu search, Permutation (music), Job shop scheduling, Benchmark (surveying), Mathematical optimization, Computer science