Evaluation of a MULTIFIT-based scheduling algorithm

DOI10.1016/0196-6774(86)90037-4MaRDI QIDQ3725543zbMATH OpenOpenAlexFDO

Authors Donald K. Friesen, Michael A. Langston

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90037-4

zbMATH Keywords

nonpreemptive scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• scientific article; zbMATH DE number 3898232
• On the worst-case ratio of a compound multiprocessor scheduling algorithm
• scientific article; zbMATH DE number 895358
• Tighter bound for MULTIFIT scheduling on uniform processors

Cited in

(16)

• Non-clairvoyant makespan minimization scheduling with predictions
• Parallel machines scheduling with nonsimultaneous machine available time
• Generalized multifit-type methods. II
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Performance of the LPT algorithm in multiprocessor scheduling
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• scientific article; zbMATH DE number 3843135 (Why is no real title available?)
• Scheduling web advertisements: a note on the minspace problem
• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Worst-case analysis of a scheduling algorithm
• Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
• Worst-case analysis of heuristics for open shops with parallel machines
• scientific article; zbMATH DE number 3898232 (Why is no real title available?)
• Minimizing makespan subject to minimum total flow-time on identical parallel machines

This page was built for publication: Evaluation of a MULTIFIT-based scheduling algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725543)