| 标题 |
[高分]
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 |
| 网址 | |
| DOI | |
| 其它 |
期刊:International Journal of Operational Research 作者:S. Saravana Kumar; C. Rajendran; Rainer Leisten 出版日期:2021-06-16 |
| 求助人 | |
| 下载 | 该求助完结已超 24 小时,文件已从服务器自动删除,无法下载。 |
PDF的下载单位、IP信息已删除
(2025-6-4)