Three-partitioning containing kernels: Complexity and heuristic

DOI10.1007/BF02247409zbMath0856.90059OpenAlexW1508910132MaRDI QIDQ1924322

Yong He, Enyu Yao, Shi Ping Chen

Publication date: 23 February 1997

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02247409

zbMATH Keywords

heuristicNP-completeworst case boundLPT-algorithm\(k\)-partitioning containing kernels

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

The multifit algorithm for set partitioning containing kernels

Cites Work

• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Optimal partitions
• A tight bound for 3-partitioning
• Optimal Set Partitioning
• Bounds on Multiprocessing Timing Anomalies
• Constrained partitioning problems

This page was built for publication: Three-partitioning containing kernels: Complexity and heuristic