 |
Two-machine flow shop scheduling problem with two competing agents
1 : RECITS laboratory, Faculty of Mathematics, USTHB University, BP 32 El-Alia, Bab Ezzouar, Algiers, Algeria.
-
Website
2 : Centre de recherche sur lÍnformation Scientifique et Technique
-
Website
5 rue des trois frères Aissou Ben Aknoun Alger -
Algeria
3 : Université du Québec à Chicoutimi
-
Website
555 Boulevard de lÚniversité, Chicoutimi, QC G7H 2B1, Canada -
Canada
In this article, we study the two-machine flow shop scheduling with two competing agents. The complexity of special cases is investigated with respect to the makespan and the total completion time. The second part concerns the minimization of the linear combination of the total tardiness and the number of tardy jobs. We presented a branch-and-bound algorithm along with a heuristic and a meta-heuristic. A computational analysis is then conducted.
