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


Solvable cases of the flow-shop problem without interruptions in job processing
Authors:Wlodzimierz Szwarc
Abstract:This article examines solvable cases of the flow-shop problem without interruptions in job processing where the completion time is being minimized. All those cases utilize Gilmore-Gomory's algorithm. A lower completion time bound is also provided.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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