Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Nodari Vakhania"'
Autor:
Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, José Alberto Hernández-Aguilar
Publikováno v:
Algorithms, Vol 17, Iss 6, p 258 (2024)
A dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard. It is proved to be beneficial to separate the sol
Externí odkaz:
https://doaj.org/article/d753842244694de9899737b3ad950937
Autor:
Nodari Vakhania
Publikováno v:
AIMS Mathematics, Vol 8, Iss 3, Pp 7061-7082 (2023)
We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time. An optimal LP-solution has been used to construct a
Externí odkaz:
https://doaj.org/article/31c340937c1a406fb47c90e195d232c0
Autor:
Víctor Hugo Pacheco-Valencia, Nodari Vakhania, Frank Ángel Hernández-Mira, José Alberto Hernández-Aguilar
Publikováno v:
Axioms, Vol 11, Iss 9, p 439 (2022)
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once. There are a number of common generalizations of the problem including the Mult
Externí odkaz:
https://doaj.org/article/da7c03346b364744b38ee1a0ed9b816a
Autor:
Nodari Vakhania, Frank Werner
Publikováno v:
Mathematics, Vol 9, Iss 6, p 633 (2021)
We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is w
Externí odkaz:
https://doaj.org/article/b7e85a68f63b4a1a9165699b60170369
Publikováno v:
Mathematics, Vol 9, Iss 5, p 480 (2021)
A nonempty subset D⊂V of vertices of a graph G=(V,E) is a dominating set if every vertex of this graph is adjacent to at least one vertex from this set except the vertices which belong to this set itself. D⊆V is a total k-dominating set if there
Externí odkaz:
https://doaj.org/article/a26465f205a445efb63c72dbbcdfd639
Autor:
Nodari Vakhania, Badri Mamporia
Publikováno v:
Mathematics, Vol 8, Iss 11, p 1919 (2020)
A basic supply chain scheduling problem in which the orders released over time are to be delivered into the batches with unlimited capacity is considered. The delivery of each batch has a fixed cost D, whereas any order delivered after its release ti
Externí odkaz:
https://doaj.org/article/ea877197c68144e6ac3f02b1a31742e9
Publikováno v:
Mathematics, Vol 8, Iss 9, p 1524 (2020)
We propose an approximation algorithm for scheduling jobs with release and delivery times on a single machine with the objective to minimize the makespan. The algorithm is based on an implicit enumeration of the set of complete solutions in a search
Externí odkaz:
https://doaj.org/article/1f54917a9b114933b7f3ca75e088b809
Autor:
Elisa Chinos, Nodari Vakhania
Publikováno v:
Cogent Engineering, Vol 4, Iss 1 (2017)
Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in production planning may give certain benefits, we conduct a detailed study of the optimality conditions and dominance relations for a strongly NP-hard sin
Externí odkaz:
https://doaj.org/article/1694fab90d3f4b3393180a5bdd185eb7
Publikováno v:
Mathematics, Vol 7, Iss 11, p 1074 (2019)
Given any function f : Z + → R + , let us define the f-index I f ( G ) = ∑ u ∈ V ( G ) f ( d u ) and the f-polynomial P f ( G , x ) = ∑ u ∈ V ( G ) x 1 / f ( d u ) − 1 , for x > 0 . In addition, we define P f ( G , 0 ) = lim x → 0 + P f
Externí odkaz:
https://doaj.org/article/3afa2b4a276544fa9c6c8067c4f26db0
Autor:
Nodari Vakhania
Publikováno v:
Algorithms, Vol 11, Iss 6, p 80 (2018)
We study a scheduling problem in which jobs with release times and due dates are to be processed on a single machine. With the primary objective to minimize the maximum job lateness, the problem is strongly NP-hard. We describe a general algorithmic
Externí odkaz:
https://doaj.org/article/328f7723c5914b0891522bd95b92e1df