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


Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Authors:Stavros G. Kolliopoulos  George Steiner
Affiliation:a Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Panepistimiopolis Ilissia, Athens, 15784, Greece
b Management Science and Information Systems, McMaster University, Canada
Abstract:We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems.
Keywords:Approximation algorithms   Scheduling   Tardiness   Just-in-time scheduling
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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