menu_book Explore the article's raw data

Online and Semi-Online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work

Abstract

In this study, we investigate several online and semi-online scheduling problems related to two hierarchical machines with a common due date to maximize the total early work. For the pure online case, we design an optimal online algorithm with a competitive ratio of root 2. Additionally, for the cases when the largest processing time is known, we give optimal algorithms with a competitive ratio of 6/5 if the largest job is a lower-hierarchy one, and of root 5 - 1 if the largest job is a higher-hierarchy one.

article Article
date_range 2024
language English
link Link of the paper
format_quote
Sorry! There is no raw data available for this article.
Loading references...
Loading citations...
Featured Keywords

online and semi-online
early work
hierarchical scheduling
competitive ratio
Citations by Year

Share Your Research Data, Enhance Academic Impact