Thek-partitioning problem

Luitpold Babel (), Hans Kellerer () and Vladimir Kotov ()

Mathematical Methods of Operations Research, 1998, vol. 47, issue 1, 59-82

Abstract: Thek-partitioning problem is defined as follows: Given a set of items {I 1 ,I 2 ,...,I n } where itemIj is of weightwj ≥ 0, find a partitionS 1 ,S 2 ,...,S m of this set with ¦S i ¦ =k such that the maximum weight of all subsetsS i is minimal,k-partitioning is strongly related to the classical multiprocessor scheduling problem of minimizing the makespan on identical machines. This paper provides suitable tools for the construction of algorithms which solve exactly the problem. Several approximation algorithms are presented for this NP-hard problem. The worst-case behavior of the algorithms is analyzed. The best of these algorithms achieves a performance bound of 4/3. Copyright Physica-Verlag 1998

Keywords: partition; multiprocessor scheduling; worst-case (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/BF01193837 (text/html)
Access to full text is restricted to subscribers.

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:mathme:v:47:y:1998:i:1:p:59-82

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/BF01193837

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().