3-Partitioning Problems for Maximizing the Minimum Load

Shi Ping Chen, Yong He () and Guohui Lin ()
Additional contact information
Shi Ping Chen: Zhejiang University
Yong He: Zhejiang University
Guohui Lin: University of Alberta

Journal of Combinatorial Optimization, 2002, vol. 6, issue 1, No 5, 67-80

Abstract: Abstract The optimization versions of the 3-Partitioning and the Kernel 3-Partitioning problems are considered in this paper. For the objective to maximize the minimum load of the m subsets, it is shown that the MODIFIED LPT algorithm has performance ratios (3m − 1)/(4m − 2) and (2m − 1)/(3m − 2), respectively, in the worst case.

Keywords: partitioning; scheduling; analysis of algorithm; worst case performance ratio; kernel (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1013370208101 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013370208101

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1013370208101

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().