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