Multidimensional Dynamic Programming Algorithm for N-Level Batching with Hierarchical Clustering Structure

This study focuses on the N-level batching problem with a hierarchical clustering structure. Clustering is the task of grouping a set of item types in such a way that item types in the same cluster are more similar (in some sense or another) to each other than to those in other clusters. In hierarch...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical problems in engineering Ročník 2017; číslo 2017; s. 1 - 12
Hlavní autori:	Lim, Seung-Kil, Kim, Jae-Gon, Bang, June-Young
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cairo, Egypt Hindawi Publishing Corporation 01.01.2017 Hindawi John Wiley & Sons, Inc
Predmet:	Algorithms Batch processing Cluster analysis Clustering Clusters Computer industry Costs Dynamic programming Hierarchies Integer programming Manufacturing Mathematical problems Tasks
ISSN:	1024-123X, 1563-5147
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!