Multiprocessor scheduling: Combining LPT and MULTIFIT

DOI10.1016/0166-218X(88)90079-0zbMath0655.90036MaRDI QIDQ1109673

Chung-Yee Lee, J. David Massey

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

multiprocessor scheduling; error bound; heuristic algorithms; comparison of algorithms; identical machines; improvement; independent jobs; total finishing time

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Unnamed Item, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Performance of the LPT algorithm in multiprocessor scheduling, Parallel machines scheduling with nonsimultaneous machine available time, Scheduling with flexible resources in parallel workcenters to minimize maximum completion time, A general lower bound for the makespan problem, Minimizing makespan subject to minimum total flow-time on identical parallel machines, Machine scheduling performance with maintenance and failure

Cites Work

• Unnamed Item
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Evaluation of a MULTIFIT-based scheduling algorithm
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies