The following pages link to Alexander Kononov (Q282244):
Displaying 48 items.
- Relocation scheduling subject to fixed processing sequences (Q282245) (← links)
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- (Q335323) (redirect page) (← links)
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Efficient approximation algorithms for the routing open shop problem (Q340238) (← links)
- (Q479007) (redirect page) (← links)
- From preemptive to non-preemptive speed-scaling scheduling (Q479009) (← links)
- Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- (Q865753) (redirect page) (← links)
- On relocation problems with multiple identical working crews (Q865754) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← links)
- Minimizing the total weighted completion time in the relocation problem (Q964872) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- When difference in machine loads leads to efficient scheduling in open shops (Q1960320) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
- Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes (Q2663742) (← links)
- A polynomially solvable case of the two-stage open shop problem for three machines (Q2729351) (← links)
- Clustering on k-Edge-Colored Graphs (Q2849897) (← links)
- Graph structure analysis and computational tractability of scheduling problems (Q2906542) (← links)
- Energy efficient scheduling and routing via randomized rounding (Q2963934) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- Computational complexity of the graph approximation problem (Q3115581) (← links)
- (Q3115718) (← links)
- Short Survey on Graph Correlation Clustering with Minimization Criteria (Q3133198) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Min-Power Covering Problems (Q3459876) (← links)
- The Routing Open Shop Problem: New Approximation Algorithms (Q3558915) (← links)
- (Q4527276) (← links)
- (Q4796176) (← links)
- From Preemptive to Non-preemptive Speed-Scaling Scheduling (Q4925232) (← links)
- Approximation Algorithms for Scheduling Problems with Exact Delays (Q5443504) (← links)
- Approximation and Online Algorithms (Q5896919) (← links)
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031) (← links)
- On cluster editing problem with clusters of small sizes (Q6588757) (← links)
- An exact solution with an improved running time for the routing flow shop problem with two machines (Q6620464) (← links)
- Minimizing makespan for parallelizable jobs with energy constraint (Q6642661) (← links)
