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
Keyword(s):
2021 ◽
Vol 1
(1)
◽
pp. 1
Keyword(s):
2021 ◽
Vol 104
◽
pp. 104375
2010 ◽
Vol 127
(1)
◽
pp. 121-128
◽
2011 ◽
Vol 38
(7)
◽
pp. 7970-7979
◽