Zobrazeno 1 - 10
of 195
pro vyhledávání: '"Kononov, Alexander"'
Two-Bar Charts Packing Problem is to pack $n$ two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. We prove that the problem remains strongly NP-hard even if each 2-BC ha
Externí odkaz:
http://arxiv.org/abs/2212.00944
Autor:
Ohta, Takeshi, Kuwada, Takashi, Dolman, Han, Moors, Eddy, Maximov, Trofim C., Kononov, Alexander V., Yabuki, Hironori
主催：JST/CREST，Vrije University, ALTERRA, IBPC
Externí odkaz:
http://hdl.handle.net/2237/6895
Autor:
Matsumoto, Kazuho, Nakai, Taro, Kuwada, Takashi, Daikoku, Ken’ichi, Kononov, Alexander V., Maximov, Trofim C., Ohta, Takeshi
主催：JST/CREST，Vrije University, ALTERRA, IBPC
Externí odkaz:
http://hdl.handle.net/2237/6893
Autor:
Kononov, Alexander, Kovalenko, Yulia
Publikováno v:
Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science, vol 12755, pp. 267-279
We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget. Each multiprocessor job requires more than one processor at the same moment of time. Processors may operate at variable spe
Externí odkaz:
http://arxiv.org/abs/2107.10142
The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is deter
Externí odkaz:
http://arxiv.org/abs/2106.14692
We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time algorithm assuming the number of nodes of the network to be bounded by a
Externí odkaz:
http://arxiv.org/abs/2004.03942
Autor:
Kononov, Alexander, Ganeev, Alexander, Jahatspanian, Igor, Chuchina, Victoria, Gubal, Anna, Kravtsov, Denis, Jin, Han, Vasiliev, Alexey
Publikováno v:
In Results in Chemistry December 2023 6
We consider a multistage framework introduced recently where, given a time horizon t=1,2,...,T, the input is a sequence of instances of a (static) combinatorial optimization problem I_1,I_2,...,I_T, (one for each time step), and the goal is to find a
Externí odkaz:
http://arxiv.org/abs/1909.10354
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.