Online scheduling with one rearrangement at the end: Revisited

Authors:
Yuxin Wang;Attila Benko;Xin Chen;GyöRgy DóSa;He Guo;Xin Han;Cecilia Sik Lanyi
Affiliations:
School of Computer Science and Technology, Dalian University of Technology, China;Department of Mathematics, University of Pannonia, Veszprém, Hungary;Software School, Dalian University of Technology, China;Department of Mathematics, University of Pannonia, Veszprém, Hungary;Software School, Dalian University of Technology, China;Software School, Dalian University of Technology, China;Virtual Environment & Imaging Technologies Lab., Univ. of Pannonia, Veszpréém, Hungary
Venue:
Information Processing Letters
Year:
2012

Citing 8
Cited 1

A simple semi on-line algorithm for P2//Cmax with a buffer

Information Processing Letters
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
The Power of Reordering for Online Minimum Makespan Scheduling

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Online scheduling on two uniform machines to minimize the makespan

Theoretical Computer Science
Online Scheduling with Bounded Migration

Mathematics of Operations Research
Online scheduling with rearrangement on two related machines

Theoretical Computer Science
Optimal algorithms for online scheduling with bounded rearrangement at the end

Theoretical Computer Science
Online scheduling with reassignment

Operations Research Letters

Semi-online hierarchical scheduling problems with buffer or rearrangements

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider an online non-preemptive scheduling problem on two related machines, with only one rearrangement at the end, called Online scheduling with one rearrangement at the end (OSORE). We proposed an improved algorithm for 1=