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


Parallel machine scheduling with nested job assignment restrictions
Authors:Gabriella Muratore
Affiliation:a Department of Technology Management, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
b Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany
c Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Abstract:We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.
Keywords:Scheduling   Approximation algorithms   Restricted assignment
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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