Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags
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 th...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2022-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2022/0354-02432100023A.pdf |
| _version_ | 1811222704630530048 |
|---|---|
| author | Almathkour Fatmah Belgacem Omar Toumi Said Jarboui Bassem |
| author_facet | Almathkour Fatmah Belgacem Omar Toumi Said Jarboui Bassem |
| author_sort | Almathkour Fatmah |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T08:19:34Z |
| format | Article |
| id | doaj.art-2015dd5c95a5400a80c72837897fb4f3 |
| institution | Directory Open Access Journal |
| issn | 0354-0243 1820-743X |
| language | English |
| last_indexed | 2024-04-12T08:19:34Z |
| publishDate | 2022-01-01 |
| publisher | University of Belgrade |
| record_format | Article |
| series | Yugoslav Journal of Operations Research |
| spelling | doaj.art-2015dd5c95a5400a80c72837897fb4f32022-12-22T03:40:37ZengUniversity of BelgradeYugoslav Journal of Operations Research0354-02431820-743X2022-01-01321455910.2298/YJOR210615023A0354-02432100023ABranch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lagsAlmathkour Fatmah0Belgacem Omar1Toumi Said2Jarboui Bassem3Department of Statistics & Operations Research, Kuwait UniversityMODILS Laboratory, Faculty of Economics and Management, University of Sfax, TunisiaDepartment of Business Administration, College of Business Administration, Majmaah University, Al Majmaah, Saudi ArabiaHigher Colleges of Technology, Abu Dhabi, UAEThis 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.http://www.doiserbia.nb.rs/img/doi/0354-0243/2022/0354-02432100023A.pdfbranch & bound algorithmtotal weighted tardinesstime lagspermutation flowshop scheduling problem |
| spellingShingle | Almathkour Fatmah Belgacem Omar Toumi Said Jarboui Bassem Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags Yugoslav Journal of Operations Research branch & bound algorithm total weighted tardiness time lags permutation flowshop scheduling problem |
| title | Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| title_full | Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| title_fullStr | Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| title_full_unstemmed | Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| title_short | Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| title_sort | branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags |
| topic | branch & bound algorithm total weighted tardiness time lags permutation flowshop scheduling problem |
| url | http://www.doiserbia.nb.rs/img/doi/0354-0243/2022/0354-02432100023A.pdf |
| work_keys_str_mv | AT almathkourfatmah branchandboundalgorithmforsolvingthetotalweightedtardinesscriterionforthepermutationflowshopschedulingproblemwithtimelags AT belgacemomar branchandboundalgorithmforsolvingthetotalweightedtardinesscriterionforthepermutationflowshopschedulingproblemwithtimelags AT toumisaid branchandboundalgorithmforsolvingthetotalweightedtardinesscriterionforthepermutationflowshopschedulingproblemwithtimelags AT jarbouibassem branchandboundalgorithmforsolvingthetotalweightedtardinesscriterionforthepermutationflowshopschedulingproblemwithtimelags |