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

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

0.00 Avg rating—0 Votes
Article ID: iaor20031411
Country: Netherlands
Volume: 30
Issue: 6
Start Page Number: 408
End Page Number: 414
Publication Date: Dec 2002
Journal: Operations Research Letters
Authors: ,
Abstract:

This paper considers the semi-on-line versions of scheduling problem P2‖Cmax. 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.

Reviews

Required fields are marked *. Your email address will not be published.