A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling

DOI10.1007/BF02014582zbMath0796.68041OpenAlexW2922330763MaRDI QIDQ1210221

Minyi Yue, Zhongliang Yu, Hans Kellerer

Publication date: 25 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02014582

zbMATH Keywords

schedulingLPT-algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime

Cites Work

• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• An Application of Bin-Packing to Multiprocessor Scheduling
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling