Generalized multifit-type methods. II (Q2714178)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized multifit-type methods. II |
scientific article; zbMATH DE number 1603977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized multifit-type methods. II |
scientific article; zbMATH DE number 1603977 |
Statements
12 June 2001
0 references
multifit methods
0 references
scheduling theory
0 references
Generalized multifit-type methods. II (English)
0 references
A well-known NP-complete problem of the scheduling theory is investigated, namely, how to distribute \(n\) tasks among \(m<n\) machines to minimize the overall finishing time. This article generalizes the classical algorithm Multifit, the bin-packing algorithm First Fit Decreasing is changed to other bin-packing procedures. NEWLINENEWLINENEWLINEThe theoretical upper bounds of the proposed algorithm is investigated, and some numerical results show its efficiency.
0 references
