Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs

2009 ◽  
Vol 60 (7) ◽  
pp. 991-1004 ◽  
Author(s):  
N Madhushini ◽  
C Rajendran ◽  
Y Deepa
2016 ◽  
Vol 19 ◽  
pp. 79-102 ◽  
Author(s):  
David R. Morrison ◽  
Sheldon H. Jacobson ◽  
Jason J. Sauppe ◽  
Edward C. Sewell

Sign in / Sign up

Export Citation Format

Share Document