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

  • Authors:

  • Zhiyi Tan;Yong He

  • Affiliations:

  • College of Electronic Engineering, Zhejiang University, Hangzhou 310027, People's Republic of China and Department of Mathematics, Zhejiang University, Hangzhou 310027, People's Republic of China;Department of Mathematics, Zhejiang University, Hangzhou 310027, People's Republic of China

  • Venue:
  • Operations Research Letters
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper considers the semi-on-line versions of scheduling problem P2||C"m"a"x. 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.