| Publication | Date of Publication | Type |
|---|
An exact solution with an improved running time for the routing flow shop problem with two machines
Journal of Scheduling | 2024-10-16 | Paper |
| Seven problems: so different yet close | 2021-12-20 | 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 |
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-05-09 | Paper |
Some positive news on the proportionate open shop problem
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-05-09 | Paper |
| To the memory of V. G. Vizing | 2018-04-06 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithms — ESA '96 | 2017-12-05 | Paper |
Efficient approximation algorithms for the routing open shop problem
Computers & Operations Research | 2016-11-14 | Paper |
A note on the Coffman-Sethi bound for LPT scheduling
Journal of Scheduling | 2015-07-28 | Paper |
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
Annals of Operations Research | 2014-09-26 | Paper |
A complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling | 2014-02-05 | 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 |
| Structural properties of optimal schedules with preemption | 2012-02-10 | Paper |
| Some properties of optimal schedules for the Johnson problem with preemption | 2012-02-10 | Paper |
A scheme of approximation solution of problem 1 |r j|L max
Journal of Applied and Industrial Mathematics | 2012-02-10 | Paper |
| An improved approximation scheme for the Johnson problem with parallel machines | 2012-02-10 | Paper |
Tight complexity analysis of the relocation problem with arbitrary release dates
Theoretical Computer Science | 2011-09-12 | Paper |
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics | 2011-03-10 | Paper |
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Automation and Remote Control | 2011-01-03 | Paper |
The Routing Open Shop Problem: New Approximation Algorithms
Approximation and Online Algorithms | 2010-05-11 | 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 |
The flow shop problem with no-idle constraints: a review and approximation
European Journal of Operational Research | 2009-06-30 | Paper |
| scientific article; zbMATH DE number 5540207 (Why is no real title available?) | 2009-04-03 | Paper |
| On solvability of the project scheduling problem with accumulative resources of an arbitrary sign | 2009-01-20 | Paper |
Open block scheduling in optical communication networks
Theoretical Computer Science | 2006-09-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
| scientific article; zbMATH DE number 2239574 (Why is no real title available?) | 2005-12-19 | Paper |
An introduction to multi-parameter complexity analysis of discrete problems
European Journal of Operational Research | 2005-04-21 | Paper |
Linear time approximation scheme for the multiprocessor open shop problem
Discrete Applied Mathematics | 2002-12-10 | Paper |
Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
Journal of Scheduling | 2002-08-08 | Paper |
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
Discrete Applied Mathematics | 2002-01-30 | 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 |
Four-parametric complexity analysis for an open shop problem
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1560545 (Why is no real title available?) | 2001-02-04 | Paper |
| scientific article; zbMATH DE number 1560505 (Why is no real title available?) | 2001-02-04 | Paper |
| scientific article; zbMATH DE number 1396582 (Why is no real title available?) | 2000-01-31 | Paper |
When difference in machine loads leads to efficient scheduling in open shops
Annals of Operations Research | 2000-01-11 | Paper |
| scientific article; zbMATH DE number 1305102 (Why is no real title available?) | 1999-06-17 | Paper |
Makespan minimization in open shops: A polynomial time approximation scheme
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Nonstrict vector summation in multi-operation scheduling
Annals of Operations Research | 1999-03-07 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithmica | 1998-10-01 | Paper |
Short Shop Schedules
Operations Research | 1998-07-06 | Paper |
Makespan minimization in preemptive two machine job shops
Computing | 1998-06-02 | Paper |
To the Steinitz lemma in coordinate form
Discrete Mathematics | 1997-08-26 | Paper |
A polynomial-time open-shop problem with an arbitrary number of machines
Cybernetics and Systems Analysis | 1997-01-20 | Paper |
| scientific article; zbMATH DE number 850331 (Why is no real title available?) | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 919274 (Why is no real title available?) | 1996-08-25 | Paper |
| scientific article; zbMATH DE number 808800 (Why is no real title available?) | 1996-03-17 | Paper |
| scientific article; zbMATH DE number 808808 (Why is no real title available?) | 1996-03-17 | Paper |
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
Operations Research | 1995-09-25 | Paper |
Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
Mathematics of Operations Research | 1995-06-14 | Paper |
On some geometric methods in scheduling theory: A survey
Discrete Applied Mathematics | 1995-04-03 | Paper |
Vector summation within minimal angle
Computational Geometry | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 165470 (Why is no real title available?) | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 22820 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4184280 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4108474 (Why is no real title available?) | 1988-01-01 | Paper |
Bounding algorithm for the routing problem with arbitrary paths and alternative servers
Cybernetics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3941251 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3896632 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3841604 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3748435 (Why is no real title available?) | 1981-01-01 | Paper |
Value of the Steinitz constant
Functional Analysis and Its Applications | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3788364 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3674746 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3737695 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3711748 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3708084 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3673844 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3648725 (Why is no real title available?) | 1975-01-01 | Paper |
