A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

2020 ◽  
Vol 158 ◽  
pp. 113556 ◽  
Author(s):  
Caio Paziani Tomazella ◽  
Marcelo Seido Nagano
Keyword(s):  
Branch And Bound ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Comprehensive Review ◽  
Branch And Bound Algorithms ◽  
Flowshop Scheduling Problem

scholarly journals A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Ju-Yong Lee ◽  
June-Young Bang
Keyword(s):  
Lower Bounds ◽  
Branch And Bound ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Two Stage ◽  
Algorithm Performance ◽  
Second Stage ◽  
Flowshop Scheduling Problem ◽  
Dominance Properties

This research considers a two-stage assembly-type flowshop scheduling problem with the objective of minimizing the total tardiness. The first stage consists of two independent machines, and the second stage consists of a single machine. Two types of components are fabricated in the first stage, and then they are assembled in the second stage. Dominance properties and lower bounds are developed, and a branch and bound algorithm is presented that uses these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. The algorithm performance is evaluated using a series of computational experiments on randomly generated instances and the results are reported.

Sign in / Sign up

Export Citation Format

Share Document