Alexander V. Kononov

Learn More
We propose a unifying framework based on configuration linear programs and randomized rounding , for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of(More)
Given a set of independent dedicated multiprocessor tasks with time-dependent execution and processor requirements , our objective is to find a schedule minimizing the makespan. In fact, the time-axis is partitionned to a set of intervals, and every task has a specific processing time and processor requirement for every time-interval. We show that this(More)
In this paper the process of data transmission in optical communication networks is modeled as a shop-type scheduling problem , where channels (wavelengths) are treated as machines. We formulate an Open Block problem with the minimum makespan objective (an OB||C max problem) in which a relation of a new type between the operations of each job is introduced:(More)
In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for(More)