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


Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
Authors:Gao  Yuan  Yuan  Jinjiang  Ng  C. T.  Cheng  T. C. E.
Abstract:4OR - We study Pareto-scheduling on an unbounded parallel-batch machine that can process any number of jobs simultaneously in a batch. The processing time of a batch is equal to the maximum...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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