Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

作     者：Kolliopoulos, Stavros G. Steiner, George 

作者机构：Univ Athens Dept Informat & Telecommun Athens Greece McMaster Univ Hamilton ON L8S 4L8 Canada 

出 版 物：《OPERATIONS RESEARCH LETTERS》 (运筹学快报)

年 卷 期：2007年第35卷第5期

页      面：685-692页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：National Resources Natural Sciences and Engineering Research Council of Canada, NSERC, (OG0001798) European Social Fund, ESF 

主　　题：approximation algorithms scheduling tardiness just-in-time scheduling 

摘      要：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. (C) 2007 Elsevier B.V. All rights reserved.