A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

1997 ◽  
Vol 96 (3) ◽  
pp. 578-590 ◽  
Author(s):  
Jinliang Cheng ◽  
Hiroshi Kise ◽  
Hironori Matsumoto
Keyword(s):  
Branch And Bound ◽  
Fuzzy Inference ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Flowshop Scheduling Problem

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.

Sign in / Sign up

Export Citation Format

Share Document