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


Quality of move-optimal schedules for minimizing total weighted completion time
Authors:Tobias Brueggemann  Johann L Hurink
Institution:Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Abstract:We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio View the MathML source. In a special case, the approximation ratio is View the MathML source.
Keywords:90B35
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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