Semi-on-line problems on two identical machines with combined partial information

作     者：Tan, ZY He, Y 

作者机构：Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China Zhejiang Univ Coll Elect Engn Hangzhou 310027 Peoples R China 

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

年 卷 期：2002年第30卷第6期

页      面：408-414页

核心收录：

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

基　　金：National Natural Science Foundation of China, NSFC, (19701028) National 973 Fundamental Research Project of China, (1998030401) TRAPOYT 

主　　题：semi-on-line parallel machine scheduling approximation algorithm competitive analysis 

摘      要：This paper considers the semi-on-line versions of scheduling problem P2 \\ C-max. We study the semi-on-line problems with combination of two types of information. Five basic types of partial information are considered. For two kinds of pairwise combination, we present their respective optimal semi-on-line algorithms which show that combination can admit to construct better algorithms. (C) 2002 Elsevier Science B.V. All rights reserved.