On the exact upper bound for the Multifit processor scheduling algorithm
From MaRDI portal
Publication:920838
DOI10.1007/BF02216826zbMath0708.90042MaRDI QIDQ920838
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Unnamed Item, Fast approximation algorithms for bi-criteria scheduling with machine assignment costs, Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime, Scheduling on same-speed processors with at most one downtime on each machine, Minimizing the makespan in nonpreemptive parallel machine scheduling problem, Performance ratios of the Karmarkar-Karp differencing method, Partial solutions and multifit algorithm for multiprocessor scheduling, Tighter bound for MULTIFIT scheduling on uniform processors, A tighter bound for FFd algorithm, Approximation for scheduling on uniform nonsimultaneous parallel machines, Scheduling on uniform processors with at most one downtime on each machine, The effect of machine availability on the worst-case performance of LPT, Parallel machine scheduling under a grade of service provision, Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\), Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations, Exact performance of MULTIFIT for nonsimultaneous machines, An optimal rounding gives a better approximation for scheduling unrelated machines
Cites Work
