|
|
|
|
|
Nasser Lotfi and Mazyar Ghadiri Nejad
Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorit...
ver más
|
|
|
|
|
|
|
|
|
Abiodun M. Ikotun and Absalom E. Ezugwu
Automatic clustering problems require clustering algorithms to automatically estimate the number of clusters in a dataset. However, the classical K-means requires the specification of the required number of clusters a priori. To address this problem, met...
ver más
|
|
|
|
|
|
|
|
|
José Victor Sá Santos and Napoleão Nepomuceno
The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns. In this ar...
ver más
|
|
|
|
|
|
|
|
|
Athanasios C. Spanos, Sotiris P. Gayialis, Evripidis P. Kechagias and Georgios A. Papadopoulos
In this research, we present a hybrid algorithmic framework and its integration into the precise production scheduling system of a Greek metal forming factory. The system was created as a decision support tool to assist production planners in arranging w...
ver más
|
|
|
|
|
|
|
|
|
Vincenzo Cutello, Georgia Fargetta, Mario Pavone and Rocco A. Scollo
Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interaction...
ver más
|
|
|
|