Tighter bound for MULTIFIT scheduling on uniform processors

DOI10.1016/0166-218X(91)90053-YzbMath0738.68010MaRDI QIDQ1175792

Bo Chen

Publication date: 25 June 1992

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

zbMATH Keywords

multiprocessor schedulingheuristic algorithmsworst-case analysisbin packinguniform-processor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem ⋮ Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations ⋮ Moderately exponential approximation for makespan minimization on related machines ⋮ Approximation for scheduling on uniform nonsimultaneous parallel machines ⋮ Scheduling on uniform processors with at most one downtime on each machine ⋮ A note on MULTIFIT scheduling for uniform machines

Cites Work

• Unnamed Item
• On the exact upper bound for the Multifit processor scheduling algorithm
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Scheduling Independent Tasks on Uniform Processors
• Bounds for Multifit Scheduling on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Tighter bound for MULTIFIT scheduling on uniform processors