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


Optimal preemptive scheduling on a fixed number of identical parallel machines
Authors:Aziz Moukrim  Alain Quilliot
Affiliation:a HeuDiaSyC UMR CNRS 6599, Université de Technologie de Compiègne, Centre de Recherches de Royallieu, BP20529, 60205 Compiègne Cedex, France
b LIMOS UMR CNRS 6158, Université de Clermont II Complexe Scientifique des Cézeaux, 63177 Aubière Cedex, France
Abstract:In this paper, we consider the preemptive scheduling problem on a fixed number of identical parallel machines. We present a polynomial-time algorithm for finding a minimal length schedule for an order class which contains properly interval orders.
Keywords:Preemptive scheduling   Linear programming   Interval orders
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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