๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A computational study of several heuristics for the DRPP

โœ Scribed by V. Campos; J. V. Savall

Book ID
105149331
Publisher
Springer US
Year
1995
Tongue
English
Weight
576 KB
Volume
4
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A computational study of several relocat
A computational study of several relocation methods for k-means algorithms
โœ Agostino Tarsitano ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 188 KB

The core of a k-means algorithm is the reallocation phase. A variety of schemes have been suggested for moving entities from one cluster to another and each of them may give a di erent clustering even though the data set is the same. The present paper describes shortcomings and relative merits of 17

Classical and new heuristics for the ope
Classical and new heuristics for the open-shop problem: A computational evaluation
โœ Christelle Guรฉret; Christian Prins ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 111 KB

We study the problem of constructing minimum makespan schedules for the Open-Shop problem. This paper presents two new heuristics: the ยฎrst one is a list scheduling algorithm with two priorities. The second is based on the construction of matchings in a bipartite graph. We develop several versions o