Exact performance of MULTIFIT for nonsimultaneous machines

Authors:
Hark-Chin Hwang;Kyungkuk Lim
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 4
Cited 0

On the exact upper bound for the MULTIFIT processor scheduling algorithm

Annals of Operations Research
Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performance ratio of MULTIFIT is 2419.