\(\kappa\)-partitioning problems for maximizing the minimum load
type: Item
instance of: scholarly article
title: \(\kappa\)-partitioning problems for maximizing the minimum load
zbMATH Open document ID: 1116.90390
DOI: 10.1016/S0898-1221(03)90201-X
author: Yong He
author: Zhiyi Tan
author: Jing Zhu
author: Enyu Yao
publication date: 2004-09-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2102424
zbMATH Keywords: Partitioning
zbMATH Keywords: Scheduling
zbMATH Keywords: Analysis of algorithm
zbMATH Keywords: Worst case ratio
MaRDI profile type: Publication
cites work: `` Strong '' NP-Completeness Results
cites work: A tight bound for 3-partitioning
cites work: A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling
cites work: The \(k\)-partitioning problem
cites work: Bounds for the cardinality constrained \(P \|C_{max}\) problem
cites work: 3-partitioning problems for maximizing the minimum load
cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time
cites work: Ordinal algorithms for packing with target center of gravity
cites work: Bin packing using semi-ordinal data
cites work: Ordinal algorithms for parallel machine scheduling
cites work: On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be nonoptimal?
cites work: Semi-on-line scheduling with ordinal data on two uniform machines
cites work: Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
cites work: Semi on-line algorithms for the partition problem
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
cites work: Scheduling workers in a constricted area
cites work: The multiple subset sum problem
cites work: The exact LPT-bound for maximizing the minimum completion time
full work available at URL: s0898-1221(03)90201-x
OpenAlex ID: W1965788090
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2102424