scholarly journals A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem

2020 ◽  
Vol 284 (3) ◽  
pp. 814-833 ◽  
Author(s):  
Jan Gmys ◽  
Mohand Mezmaz ◽  
Nouredine Melab ◽  
Daniel Tuyttens
Sign in / Sign up

Export Citation Format

Share Document