Anzeige
Erschienen in:
01.05.2015
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
Erschienen in: Journal of Combinatorial Optimization | Ausgabe 4/2015
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
This paper considers an online hierarchical scheduling problem on two parallel identical machines. The objective is to minimize the makspan. It is assumed that all jobs have bounded processing times in between \(p\) and \(rp\), where \(p>0\) and \(r\ge 1\). We first improve a previous result by giving an optimal online algorithm for the non-preemptive version. For the preemptive version, we present an optimal preemptive algorithm without introducing idle time for all \(r\ge 1\). If the algorithm is allowed to use idle time, we show that the semi-online information that jobs are tightly-grouped cannot help improve the bound of the pure online problem.