42 citations · 43 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021★ 1 cited
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
Alexander Kononov, Yulia Kovalenko
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 proces…
math.OC2021
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
Alexander Kononov, Julia Memar, Yakov Zinder
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…