Semi-online scheduling problems on two identical machines with inexact partial information

Zhiyi Tan, Yong He
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In semi-online scheduling problems, we always assume that some partial additional information is exactly known in advance. This may not be true in some applications. This paper considers semi-online scheduling problems on two identical machines with inexact partial information. Three versions are considered, where we know in advance that the total size of all jobs, the optimal value, and the largest job size are in given intervals, respectively, while their exact values are unknown. We give
more &raquo; ... lower bounds of the problems and competitive ratios of algorithms as functions of a so-called disturbance parameter r ∈ [1, ∞). We establish for which r the inexact partial information is useful to improve the performance of a semi-online algorithm with respect to its pure online problem. Optimal or near optimal algorithms are then obtained.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/j.tcs.2007.02.014</a> <a target="_blank" rel="external noopener" href="">fatcat:rurgm3l3nraqbhnus7wdw6lciq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>