The multifit algorithm for set partitioning containing kernels

DOI10.1007/S11766-999-0029-7MaRDI QIDQ1807874zbMATH OpenOpenAlexFDO

Authors Yong He

Publication date 23 November 1999

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-999-0029-7

zbMATH Keywords

machine schedulingset partitioningnonsimultaneous machine release times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1080288
• A note on MULTIFIT scheduling for uniform machines
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• Tighter Bounds for the Multifit Processor Scheduling Algorithm

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1559404 (Why is no real title available?)
• An Application of Bin-Packing to Multiprocessor Scheduling
• Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
• Parallel machines scheduling with nonsimultaneous machine available time
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• Three-partitioning containing kernels: Complexity and heuristic

Cited in

(1)

• Exact performance of MULTIFIT for nonsimultaneous machines

This page was built for publication: The multifit algorithm for set partitioning containing kernels

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