Online scheduling of parallel jobs with preemption on two identical machines
type: Item
instance of: scholarly article
title: Online scheduling of parallel jobs with preemption on two identical machines
zbMATH Open document ID: 1262.90065
author: Shouwei Guo
author: Liying Kang
published in: Operations Research Letters
publication date: 2013-05-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6162994
zbMATH Keywords: scheduling
zbMATH Keywords: parallel jobs
zbMATH Keywords: preemption
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.orl.2013.01.002
OpenAlex ID: W2038007422
DOI: 10.1016/J.ORL.2013.01.002
Recommended article: Online scheduling of two type parallel jobs on identical machines
Recommended article: Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
Recommended article: On-line scheduling of parallel jobs on two machines
Recommended article: Online nonpreemptive scheduling of equal-length jobs on two identical machines
Recommended article: ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES
Recommended article: Online scheduling of parallel jobs on two machines is 2-competitive
Recommended article: Online scheduling of malleable parallel jobs with setup times on two identical machines
Recommended article: Q4489614
Recommended article: Online Scheduling of Equal-Length Jobs on Parallel Machines
Recommended article: Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
description: scientific article; zbMATH DE number 6162994