Bin stretching with migration on two hierarchical machines

Islam Akaria () and Leah Epstein ()
Additional contact information
Islam Akaria: University of Haifa
Leah Epstein: University of Haifa

Mathematical Methods of Operations Research, 2023, vol. 98, issue 1, No 7, 153 pages

Abstract: Abstract In this paper, we consider semi-online scheduling with migration on two hierarchical machines, with the purpose of minimizing the makespan. The meaning of two hierarchical machines is that one of the machines can run any job, while the other machine can only run specific jobs. Every instance also has a fixed parameter $$M \ge 0$$ M ≥ 0 , known as the migration factor. Jobs are presented one by one. Each new job has to be assigned to a machine when it arrives, and at the same time it is possible to modify the assignment of previously assigned jobs, such that the moved jobs have a total size not exceeding M times the size of the new job. The semi-online variant studied here is called bin stretching. In this problem, the optimal offline makespan is provided to the scheduler in advance. This is still a non-trivial variant for any migration factor $$M > 0$$ M > 0 . We prove tight bounds on the competitive ratio for any migration factor M. The design and analysis is split into several cases, based on the value of M, and on the resulting competitive ratio. Unlike the online variant with migration for two hierarchical machines, this case allows an online fully polynomial time approximation scheme.

Keywords: Hierarchical machines; Competitive ratio; Migration factor; Semi-online scheduling (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00186-023-00830-3 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:mathme:v:98:y:2023:i:1:d:10.1007_s00186-023-00830-3

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-023-00830-3

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().