This page is under construction, please visit later..

"Une étude d'approches heuristiques pour l'ordonnancement des jobs dans le flowshop"

Tayeb Lemlouma, Juillet 2000.


Since the flowshop scheduling problem has found to be an NP-complete problem, the development of heuristic algorithms that give better solutions become necessary. In this paper we discuss how to resolve the flowshop problem using heuristic methods, we were based on the study of [RAJ 91] in which three heuristic algorithms with the objective of minimizing total flowtime are proposed. In our paper we have detailed the concept introduced and given proofs of the principle formulas used in the algorithms presented. Our paper can be viewed as a contribution to understand better how to develop heuristic solution choosing the best minimizing criteria.


The flowshop problem, Heuristics, Job scheduling, Total flowtime.

Please send your comments to