|
|
|
|
|
Tamer F. Abdelmaguid
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alessandro Agnetis, Fabrizio Rossi and Stefano Smriglio
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish?start, here the task of a job cannot start before...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Werner, Larysa Burtseva and Yuri N. Sotskov
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ?Algorithms for Scheduling Problems?. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor and Ivo Grosse
-
|
|
|
|
|
|
|
|
|
|
|
Enrico Bianchi and Paolo Penna
This work studies clustering algorithms which operates with ordinal or comparison-based queries (operations), a situation that arises in many active-learning applications where ?dissimilarities? between data points are evaluated by humans. Typically, exa...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chandra Agung, Natalia Christine
Pág. 69 - 75
The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem...
ver más
|
|
|
|
|
|
|
|
|
|
|
Efelin Siburian, Mohammad Andri Budiman, Jos Timanta
Pág. 38 - 44
Indonesia has a variety of local languages, which is the Batak Toba language. This time, there are still some Batak Toba people who do not know speak Batak Toba language fluently. Nowadays, desktop based dictionary is one of reference that very efficient...
ver más
|
|
|
|
|
|
|
|
|
|
|
Borislav Slavchev, Evelina Masliankova and Steven Kelk
We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-the-ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sai Prashanth Josyula, Johanna Törnquist Krasemann and Lars Lundberg
In railway traffic systems, whenever disturbances occur, it is important to effectively reschedule trains while optimizing the goals of various stakeholders. Algorithms can provide significant benefits to support the traffic controllers in train reschedu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Yulia Terentyeva
Pág. 13 - 21
The paper deals with the development of the topology of ultra-large communication networks, i.e. networks containing several thousand vertices. In this case, the coordinates of the vertices of the undirected graph are somehow predetermined and a set of e...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jason Deane, Anurag Agarwal
The multi-dimensional knapsack problem (MDKP) is a well-studied problem in Decision Sciences. The problems NP-Hard nature prevents the successful application of exact procedures such as branch and bound, implicit enumeration and dynamic programming for l...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patcharin Buayen and Jeeraporn Werapun
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Irina Polyakova,Svetlana Burdukovskaya
Pág. 28 - 37
The article deals with algorithm for linking the coordinates of an object to a road graph. Similar algorithms are used in every application due to the widespread use of electronic devices. Such algorithms may have some inaccuracies, which makes it diffic...
ver más
|
|
|
|
|
|
|
|
|
|
|
Irina Polyakova,Svetlana Burdukovskaya
Pág. 28 - 37
The article deals with algorithm for linking the coordinates of an object to a road graph. Similar algorithms are used in every application due to the widespread use of electronic devices. Such algorithms may have some inaccuracies, which makes it diffic...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrei V. Panteleev and Anna A. Kolessa
A new hybrid metaheuristic method for optimizing the objective function on a parallelepiped set of admissible solutions is proposed. It mimics the behavior of a school of river perch when looking for food. The algorithm uses the ideas of several methods:...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lev Kazakovtsev, Ivan Rozhnov, Aleksey Popov and Elena Tovbis
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages resear...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rommel Dias Saraiva, Napoleão Nepomuceno and Plácido Rogério Pinheiro
We propose in this paper a two-phase approach that decomposes the process of solving the three-dimensional single Container Loading Problem (CLP) into subsequent tasks: (i) the generation of blocks of boxes and (ii) the loading of blocks into the contain...
ver más
|
|
|
|
|
|
|
|
|
|
|
D.V Lemtyuzhnikova,D.V. Kovkov
Pág. 1 - 8
We consider algorithms for solving integer optimization problems with quasi--block structure. Modern decomposition approaches are analyzed. We study Finkelstein decomposition and it variations for discovering quasi--block structure. Efficiency of local e...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kenneth Lange
The Hausdorff distance between two closed sets has important theoretical and practical applications. Yet apart from finite point clouds, there appear to be no generic algorithms for computing this quantity. Because many infinite sets are defined by algeb...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jianying Wei, Yuming Liu, Xiaochun Lu, Yu Feng and Yadi Wang
Tunnel construction projects are a classic type of repetitive project, and hold a crucial position in the construction industry. The linear scheduling method (LSM) has been in the spotlight in scheduling optimization for repetitive construction projects ...
ver más
|
|
|
|
|
|