Preemptive on-line scheduling for two uniform processors
type: Item
instance of: scholarly article
title: Preemptive on-line scheduling for two uniform processors
zbMATH Open document ID: 0957.90066
DOI: 10.1016/S0167-6377(98)00032-7
author: Jianjun Wen
author: Donglei Du
published in: Operations Research Letters
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1347078
zbMATH Keywords: one-line scheduling
zbMATH Keywords: competitive ratio
zbMATH Keywords: preemption
zbMATH Keywords: uniform processors
MaRDI profile type: Publication
cites work: An optimal algorithm for preemptive on-line scheduling
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Competitive snoopy caching
full work available at URL: s0167-6377(98)00032-7
OpenAlex ID: W2046608953
Recommended article: Optimal preemptive semi-online scheduling on two uniform processors
Recommended article: On-line preemptive scheduling on uniform machines
Recommended article: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Recommended article: Semi-online scheduling on two uniform processors
Recommended article: Optimal Preemptive Scheduling of Two Unrelated Processors
Recommended article: Preemptive stochastic online scheduling on two uniform machines
Recommended article: Online scheduling of parallel jobs with preemption on two identical machines
Recommended article: Ideal preemptive schedules on two processors
Recommended article: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
Recommended article: An On-Line Algorithm for Some Uniform Processor Scheduling
description: scientific article; zbMATH DE number 1347078