Online scheduling with rearrangement on two related machines
type: Item
instance of: scholarly article
title: Online scheduling with rearrangement on two related machines
zbMATH Open document ID: 1206.68064
author: György Dósa
author: Xin Han
author: He Guo
author: Yuxin Wang
published in: Theoretical Computer Science
publication date: 2011-02-21T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5853798
zbMATH Keywords: scheduling problems
zbMATH Keywords: competitive analysis
zbMATH Keywords: online non-preemptive scheduling problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.10.019
OpenAlex ID: W2032691644
cites work: Better Bounds for Online Scheduling
cites work: New algorithms for an ancient scheduling problem.
cites work: Online scheduling with reassignment on two uniform machines
cites work: Online scheduling with a buffer on related machines
cites work: Preemptive Online Scheduling with Reordering
cites work: The Power of Reordering for Online Minimum Makespan Scheduling
cites work: `` Strong '' NP-Completeness Results
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Improved Bounds for the Online Scheduling Problem
cites work: A Better Algorithm for an Ancient Scheduling Problem
cites work: Semi on-line algorithms for the partition problem
cites work: Online scheduling on two uniform machines to minimize the makespan
cites work: Online Scheduling with Bounded Migration
cites work: On-line scheduling revisited
cites work: Online scheduling with reassignment
cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
DOI: 10.1016/J.TCS.2010.10.019
description: scientific article; zbMATH DE number 5853798