Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan

Han Zhang, Lingfa Lu () and Jinjiang Yuan
Additional contact information
Han Zhang: Zhengzhou University
Lingfa Lu: Zhengzhou University
Jinjiang Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 1, No 6, 17 pages

Abstract: Abstract In this paper we study the online over-time scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. First, we show that the general problem has a low bound 2 and then design a 4-competitive online algorithm. Furthermore, we consider a special case in which the jobs have agreeable processing times and weights. When all jobs have the same weights (the task is to minimize the makespan), an online algorithm with the best possible competitive ratio $$\frac{\sqrt{5}+1}{2}\approx 1.618$$ 5 + 1 2 ≈ 1.618 has been established in the literature. We show that, after a slightly modification, this known online algorithm also has the best possible competitive ratio $$\frac{\sqrt{5}+1}{2}\approx 1.618$$ 5 + 1 2 ≈ 1.618 for our problem. Finally, we introduce limited restarts into the above special case and present an online algorithm with a better competitive ratio $$\frac{11}{7}\approx 1.571$$ 11 7 ≈ 1.571 .

Keywords: Online scheduling; Parallel-batch machine; Weighted makespan; Limited restart; Competitive ratio (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01242-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:1:d:10.1007_s10878-024-01242-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01242-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().