Total tardiness minimisation in permutation flow shops: a simple approach based on a variable greedy algorithm

Jose Manuel Framinan (1) , Rainer Leisten (2)

1 Industrial Management, School of Engineering
2 Production Management

In this paper, we address the problem of scheduling jobs in a permutation flowshop with the objective of minimizing the total tardiness of jobs. To tackle this problem, we suggest employing a procedure based on a greedy algorithm that successively iterates over an increasing number of candidate solutions. The computational experiments carried out show this algorithm to outperform the best existing one for the problem under consideration. In addition, we carry out some tests to analyse the efficiency of the adopted design.

Mots clés: Physical Sciences

Jose Manuel Framinan, Rainer Leisten. Total tardiness minimisation in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research, 2008, 46 (22), pp.6479-6498. ⟨10.1080/00207540701418960⟩. ⟨hal-00512985⟩