A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

作     者：Kasperski, Adam Zielinski, Pawel 

作者机构：Wroclaw Univ Technol Inst Ind Engn & Management PL-50370 Wroclaw Poland Wroclaw Univ Technol Inst Math & Comp Sci PL-50370 Wroclaw Poland 

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

年 卷 期：2008年第36卷第3期

页      面：343-344页

核心收录：

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

主　　题：scheduling interval data minmax regret approximation algorithm 

摘      要：In this paper we discuss a minmax regret version of the single-machine scheduling problem with the total flow time criterion. Uncertain processing times are modeled by closed intervals. We show that if the deterministic problem is polynomially solvable, then its minmax regret version is approximable within 2. (C) 2007 Elsevier B.V. All rights reserved.