-partitioning problems for maximizing the minimum load

DOI10.1016/S0898-1221(03)90201-XMaRDI QIDQ1879573zbMATH OpenOpenAlexFDO

Authors Yong He, Zhiyi Tan, Jing Zhu, Enyu Yao

Publication date 23 September 2004

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(03)90201-x

zbMATH Keywords

SchedulingPartitioningAnalysis of algorithmWorst case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• 3-partitioning problems for maximizing the minimum load
• \(k\)-partitioning problems with partition matroid constraint
• The \(k\)-partitioning problem
• Partitioning under the \(L_p\) norm
• scientific article; zbMATH DE number 1185313

Cites work

• 3-partitioning problems for maximizing the minimum load
• A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling
• A tight bound for 3-partitioning
• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• Bin packing using semi-ordinal data
• Bounds for the cardinality constrained \(P \|C_{max}\) problem
• Bounds on Multiprocessing Timing Anomalies
• On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?
• Ordinal algorithms for packing with target center of gravity
• Ordinal algorithms for parallel machine scheduling
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Scheduling workers in a constricted area
• Semi on-line algorithms for the partition problem
• Semi-on-line scheduling with ordinal data on two uniform machines
• The \(k\)-partitioning problem
• The exact LPT-bound for maximizing the minimum completion time
• The multiple subset sum problem
• `` Strong NP-Completeness Results

Cited in

(9)

• Online cardinality constrained scheduling
• EPTAS for the dual of splittable bin packing with cardinality constraint
• 3-partitioning problems for maximizing the minimum load
• Optimal matroid partitioning problems
• Optimal matroid partitioning problems
• \(k\)-partitioning problems with partition matroid constraint
• Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint
• Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
• EPTAS for parallel identical machine scheduling with time restrictions

This page was built for publication: \(\kappa\)-partitioning problems for maximizing the minimum load

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