Open AccessBranch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags
Author(s) -
Fatmah Almathkour,
Omar Belgacem,
Saïd Toumi,
Bassem Jarboui
Publication year - 2022
Publication title -
yugoslav journal of operations research/yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 2334-6043
pISSN - 0354-0243
DOI - 10.2298/yjor210615023a
Subject(s) - tardiness , scheduling (production processes) , permutation (music) , job shop scheduling , mathematical optimization , computer science , branch and bound , upper and lower bounds , flow shop scheduling , algorithm , mathematics , schedule , mathematical analysis , physics , acoustics , operating system
This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.