| Publication | Date of Publication | Type |
|---|
Minimizing makespan for parallelizable jobs with energy constraint
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-25 | Paper |
An exact solution with an improved running time for the routing flow shop problem with two machines
Journal of Scheduling | 2024-10-16 | Paper |
| On cluster editing problem with clusters of small sizes | 2024-08-16 | Paper |
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
Journal of Combinatorial Optimization | 2024-05-06 | Paper |
LP-based algorithms for multistage minimization problems
(available as arXiv preprint) | 2022-03-22 | Paper |
A simple rounding scheme for multistage optimization
Theoretical Computer Science | 2022-02-21 | Paper |
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
(available as arXiv preprint) | 2021-04-19 | Paper |
Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
Theoretical Computer Science | 2019-10-07 | Paper |
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling | 2018-11-07 | Paper |
Single-machine scheduling with supporting tasks
Discrete Optimization | 2018-05-24 | Paper |
Short survey on graph correlation clustering with minimization criteria
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Energy efficient scheduling and routing via randomized rounding
(available as arXiv preprint) | 2017-02-21 | Paper |
Efficient approximation algorithms for the routing open shop problem
Computers & Operations Research | 2016-11-14 | Paper |
Clustering on \(k\)-edge-colored graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Journal of Scheduling | 2016-05-13 | Paper |
Relocation scheduling subject to fixed processing sequences
Journal of Scheduling | 2016-05-12 | Paper |
Min-Power Covering Problems
Algorithms and Computation | 2016-01-11 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
Discrete Applied Mathematics | 2014-12-05 | Paper |
Bounded max-colorings of graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
A complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling | 2014-02-05 | Paper |
Clustering on k-Edge-Colored Graphs
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Integer preemptive scheduling on parallel machines
Operations Research Letters | 2013-03-05 | Paper |
| Graph structure analysis and computational tractability of scheduling problems | 2012-09-05 | Paper |
Computational complexity of the graph approximation problem
Journal of Applied and Industrial Mathematics | 2012-02-10 | Paper |
| Structural properties of optimal schedules with preemption | 2012-02-10 | Paper |
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics | 2011-03-10 | Paper |
Bounded Max-colorings of Graphs
Algorithms and Computation | 2010-12-09 | Paper |
The Routing Open Shop Problem: New Approximation Algorithms
Approximation and Online Algorithms | 2010-05-11 | Paper |
Minimizing the total weighted completion time in the relocation problem
Journal of Scheduling | 2010-04-21 | Paper |
Integrality Property in Preemptive Parallel Machine Scheduling
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Complete Complexity Classification of Short Shop Scheduling
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation Algorithms for Scheduling Problems with Exact Delays
Approximation and Online Algorithms | 2008-02-21 | Paper |
Customer order scheduling to minimize the number of late jobs
European Journal of Operational Research | 2007-07-04 | Paper |
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling | 2007-05-15 | Paper |
On relocation problems with multiple identical working crews
Discrete Optimization | 2007-02-20 | Paper |
Open block scheduling in optical communication networks
Theoretical Computer Science | 2006-09-14 | Paper |
Scheduling tasks with small communication delays for clusters of processors
Annals of Operations Research | 2004-08-10 | Paper |
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
Theoretical Computer Science | 2004-03-14 | Paper |
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters | 2003-04-03 | Paper |
| scientific article; zbMATH DE number 1875417 (Why is no real title available?) | 2003-03-02 | Paper |
A polynomially solvable case of the two-stage open shop problem for three machines
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-07-22 | Paper |
| scientific article; zbMATH DE number 1560505 (Why is no real title available?) | 2001-02-04 | Paper |
When difference in machine loads leads to efficient scheduling in open shops
Annals of Operations Research | 2000-01-11 | Paper |
