Fast fully polynomial approximation schemes for minimizing completion time variance

作     者：Kubiak, W Cheng, JL Kovalyov, MY 

作者机构：Mem Univ Newfoundland Fac Business Adm St John NF A1B 3X5 Canada Natl Acad Sci Byelarus Inst Engn Cybernet Minsk 220012 BELARUS 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (欧洲运筹学杂志)

年 卷 期：2002年第137卷第2期

页      面：303-309页

核心收录：

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

基　　金：Natural Sciences and Engineering Research Council of Canada  NSERC  (OGP0105675) 

主　　题：fully polynomial approximation scheme completion time variance scheduling 

摘      要：We present fully polynomial approximation schemes (FPASs) for the problem of minimizing completion time variance (CTV) of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n(2)/epsilon) and thus improves on all fully polynomial approximation schemes presented in the literature. (C) 2002 Published by Elsevier Science B.V.