An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
type: Item
instance of: scholarly article
title: An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
zbMATH Open document ID: 1242.90080
author: Uwe Schwiegelshohn
published in: Operations Research Letters
publication date: 2012-07-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6055708
zbMATH Keywords: total weighted completion time scheduling
zbMATH Keywords: worst case analysis
zbMATH Keywords: performance guarantee
MaRDI profile type: Publication
full work available at URL: j.orl.2011.06.007
OpenAlex ID: W1993301069
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: Structure of a simple scheduling polyhedron
DOI: 10.1016/J.ORL.2011.06.007
Wikidata QID: Q130471459
Recommended article: Towards a proof of the Kuzmak-Kogelman-Keller algorithm
Recommended article: Q4453332
Recommended article: Q3035528
Recommended article: Q4207245
Recommended article: A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
Recommended article: A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm
Recommended article: Proof of the Kurlberg-Rudnick rate conjecture
Recommended article: Proof of the Kurlberg-Rudnick Rate Conjecture
Recommended article: A new proof of the Kuhn-Tucker and Farkas theorems
description: scientific article; zbMATH DE number 6055708