Tighter Bounds for the Multifit Processor Scheduling Algorithm
From MaRDI portal
Publication:3326834
DOI10.1137/0213013zbMath0539.68024OpenAlexW2020196988MaRDI QIDQ3326834
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213013
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
On the worst-case ratio of a compound multiprocessor scheduling algorithm, Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime, Multiprocessor scheduling: Combining LPT and MULTIFIT, Performance ratios of the Karmarkar-Karp differencing method, Parallel machine scheduling with nested processing set restrictions, Scheduling web advertisements: a note on the minspace problem, Partial solutions and multifit algorithm for multiprocessor scheduling, Scheduling and fixed-parameter tractability, Scheduling batches on parallel machines with major and minor set-ups, A state-of-the-art review of parallel-machine scheduling research, On the exact upper bound for the Multifit processor scheduling algorithm, Approximability of scheduling with fixed jobs, A dynamic edge covering and scheduling problem: complexity results and approximation algorithms, Minimizing the makespan on two identical parallel machines with mold constraints, Minimizing the makespan in nonpreemptive parallel machine scheduling problem, Tighter bound for MULTIFIT scheduling on uniform processors, Unrelated parallel machine scheduling -- perspectives and progress, A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling, An optimal rounding gives a better approximation for scheduling unrelated machines, Scheduling algorithms for flexible flowshops: Worst and average case performance, Performance of the LPT algorithm in multiprocessor scheduling, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Parallel machines scheduling with nonsimultaneous machine available time, Fair cost-sharing methods for scheduling jobs on parallel machines, Unnamed Item, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Worst-case analysis of heuristics for open shops with parallel machines, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
