Evaluation of a MULTIFIT-based scheduling algorithm
From MaRDI portal
Publication:3725543
DOI10.1016/0196-6774(86)90037-4zbMath0594.68039OpenAlexW2048241500MaRDI QIDQ3725543
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
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, Multiprocessor scheduling: Combining LPT and MULTIFIT, Scheduling web advertisements: a note on the minspace problem, Improved approximation algorithms for scheduling parallel jobs on identical clusters, Scheduling algorithms for flexible flowshops: Worst and average case performance, Performance of the LPT algorithm in multiprocessor scheduling, Parallel machines scheduling with nonsimultaneous machine available time, Minimizing makespan subject to minimum total flow-time on identical parallel machines, 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
