scholarly journals Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags

2021 ◽  
pp. 23-23
Author(s):  
Fatmah Almathkour ◽  
Omar Belgacem ◽  
Said Toumi ◽  
Bassem Jarboui
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Total Weighted Tardiness ◽  
Time Lags ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Weighted Tardiness ◽  
Time Requirements ◽  
Flowshop Scheduling Problem

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.

scholarly journals A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Ik Sun Lee
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Total Weighted Tardiness ◽  
Scheduling Problem ◽  
Weighted Tardiness ◽  
Second Stage ◽  
Multiple Components ◽  
Assembly Scheduling ◽  
Constructive Heuristics ◽  
Assembly Flowshop

This paper considers an assembly scheduling problem which minimizes the total weighted tardiness. The system consists of multiple manufacturing machines in the first stage and an assembly machine in the second stage. A job is composed of multiple components, each component is manufactured on a dedicated machine in the first stage, and the assembly starts on the assembly machine after the completion of all the components’ manufacturing in the first stage. This paper is to try to find effective and efficient schedules to minimize the total weighted tardiness of jobs. This paper analyzes some solution properties to improve search effectiveness and efficiency. Moreover, some lower-bound procedures are derived, and then four constructive heuristics and a branch-and-bound algorithm are suggested. The performances of the derived algorithms are evaluated through numerical experiments. For the problems with no more than 15 jobs, the branch-and-bound algorithm finds the optimal solutions within 20 minutes, and the performance of the four heuristics seems to be similar. However, for problems with more than 30 jobs, HWT shows the best performance among the four heuristics except for two machines.

Sign in / Sign up

Export Citation Format

Share Document