首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Authors:FJ Hwang  MY Kovalyov  BMT Lin
Institution:1. Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Taiwan;2. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Belarus
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号