One aspect that has mostly been overlooked in traditional economic lot-sizing is the implication of decisions on manual tasks and workload. Although lot-sizing decisions can have a significant impact on required manual material handling and on human performance, works that consider ergonomic aspects in lot-sizing are rare. This paper presents a model that integrates ergonomic aspect in terms of...

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...

This research aims to find out what data mining techniques are effectively implemented in museums and application trends currently being used improve museum performance towards modern based on intelligent system technology. The review was carried a number of articles found journals proceedings the 2004-2020 period. It is that majority virtual guide applications, recommender systems, collection ...

The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...

The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...

The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...

The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...