scientific article; zbMATH DE number 895358
From MaRDI portal
Publication:4883370
zbMATH Open0847.90078MaRDI QIDQ4883370FDOQ4883370
Authors: Feng Cao 
Publication date: 13 October 1996
Title of this publication is not available (Why is that?)
Recommendations
- On the exact upper bound for the Multifit processor scheduling algorithm
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- Tighter bound for MULTIFIT scheduling on uniform processors
- Evaluation of a MULTIFIT-based scheduling algorithm
Cited In (7)
- Exact performance of MULTIFIT for nonsimultaneous machines
- Generalized multifit-type methods. II
- Tighter bound for MULTIFIT scheduling on uniform processors
- Evaluation of a MULTIFIT-based scheduling algorithm
- On the exact upper bound for the Multifit processor scheduling algorithm
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883370)
