Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
type: Item
instance of: scholarly article
title: Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
zbMATH Open document ID: 1390.90310
author: György Dósa
author: Armin Fügenschuh
author: Zhiyi Tan
author: Zsolt Tuza
author: Krzysztof Węsek
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-06-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6890255
zbMATH Keywords: scheduling
zbMATH Keywords: semi-online algorithm
zbMATH Keywords: makespan minimization
zbMATH Keywords: mixed-integer linear programming
MaRDI profile type: Publication
full work available at URL: s10100-017-0481-z
OpenAlex ID: W2625359686
Wikidata QID: Q47555800
cites work: Better Bounds for Online Scheduling
cites work: The on-line multiprocessor scheduling problem with known sum of the tasks
cites work: Semi on-line scheduling on three processors with known sum of the tasks
cites work: Semi-online scheduling on two uniform processors
cites work: Geometric representation for semi on-line scheduling on uniform processors
cites work: On-line bin-stretching
cites work: On-Line Load Balancing for Related Machines
cites work: A two-phase algorithm for bin stretching with stretching factor 1.5
cites work: Online bin stretching with three bins
cites work: Semi-on-line multiprocessor scheduling with given total processing time
cites work: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
cites work: A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
cites work: Bin stretching revisited
cites work: Q3031924
cites work: On-line scheduling revisited
cites work: Online bin stretching with bunch techniques
cites work: Q4952670
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Semi on-line algorithms for the partition problem
cites work: Semi-online scheduling problems on a small number of machines
cites work: Two semi-online scheduling problems on two uniform machines
DOI: 10.1007/S10100-017-0481-Z
description: scientific article; zbMATH DE number 6890255