Bounding strategies for obtaining a lower bound for N-job and M-machine flowshop scheduling problem with objective of minimising the total flowtime of jobs

2021 ◽  
Vol 41 (2) ◽  
pp. 244
Author(s):  
S. Saravana Kumar ◽  
C. Rajendran ◽  
Rainer Leisten
Sign in / Sign up

Export Citation Format

Share Document