List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| An exact solution with an improved running time for the routing flow shop problem with two machines xxxJournal of Scheduling j=[Journal of Scheduling] a=[ ] j-bytes=[74,111,117,114,110,97,108,32,111,102,32,83,99,104,101,100,117,108,105,110,103] | 2024-10-16 | Paper |
| Seven problems: so different yet close xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 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 xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2021-04-19 | Paper |
| An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times xxxSibirskie Elektronnye Matematicheskie Izvestiya j=[Sibirskie Elektronnye Matematicheskie Izvestiya] a=[ ] j-bytes=[83,105,98,105,114,115,107,105,101,32,69,108,101,107,116,114,111,110,110,121,101,32,77,97,116,101,109,97,116,105,99,104,101,115,107,105,101,32,73,122,118,101,115,116,105,121,97] | 2019-05-09 | Paper |
| Some positive news on the proportionate open shop problem xxxSibirskie Elektronnye Matematicheskie Izvestiya j=[Sibirskie Elektronnye Matematicheskie Izvestiya] a=[ ] j-bytes=[83,105,98,105,114,115,107,105,101,32,69,108,101,107,116,114,111,110,110,121,101,32,77,97,116,101,109,97,116,105,99,104,101,115,107,105,101,32,73,122,118,101,115,116,105,121,97] | 2019-05-09 | Paper |
| To the memory of V. G. Vizing xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2018-04-06 | Paper |
| On-line and off-line approximation algorithms for vector covering problems xxxAlgorithms — ESA '96 j=[Algorithms — ESA '96] a=[ ] j-bytes=[65,108,103,111,114,105,116,104,109,115,32,226,128,148,32,69,83,65,32,39,57,54] | 2017-12-05 | Paper |
| Efficient approximation algorithms for the routing open shop problem xxxComputers & Operations Research j=[Computers & Operations Research] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,115,32,92,38,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2016-11-14 | Paper |
| A note on the Coffman-Sethi bound for LPT scheduling xxxJournal of Scheduling j=[Journal of Scheduling] a=[ ] j-bytes=[74,111,117,114,110,97,108,32,111,102,32,83,99,104,101,100,117,108,105,110,103] | 2015-07-28 | Paper |
| On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion xxxAnnals of Operations Research j=[Annals of Operations Research] a=[ ] j-bytes=[65,110,110,97,108,115,32,111,102,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2014-09-26 | Paper |
| A complete 4-parametric complexity classification of short shop scheduling problems xxxJournal of Scheduling j=[Journal of Scheduling] a=[ ] j-bytes=[74,111,117,114,110,97,108,32,111,102,32,83,99,104,101,100,117,108,105,110,103] | 2014-02-05 | Paper |
| Integer preemptive scheduling on parallel machines xxxOperations Research Letters j=[Operations Research Letters] a=[ ] j-bytes=[79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104,32,76,101,116,116,101,114,115] | 2013-03-05 | Paper |
| Graph structure analysis and computational tractability of scheduling problems xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2012-09-05 | Paper |
| Structural properties of optimal schedules with preemption xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2012-02-10 | Paper |
| Some properties of optimal schedules for the Johnson problem with preemption xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2012-02-10 | Paper |
| A scheme of approximation solution of problem 1 |r j|L max xxxJournal of Applied and Industrial Mathematics j=[Journal of Applied and Industrial Mathematics] a=[ ] j-bytes=[74,111,117,114,110,97,108,32,111,102,32,65,112,112,108,105,101,100,32,97,110,100,32,73,110,100,117,115,116,114,105,97,108,32,77,97,116,104,101,109,97,116,105,99,115] | 2012-02-10 | Paper |
| An improved approximation scheme for the Johnson problem with parallel machines xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2012-02-10 | Paper |
| Tight complexity analysis of the relocation problem with arbitrary release dates xxxTheoretical Computer Science j=[Theoretical Computer Science] a=[ ] j-bytes=[84,104,101,111,114,101,116,105,99,97,108,32,67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101] | 2011-09-12 | Paper |
| Properties of optimal schedules in preemptive shop scheduling xxxDiscrete Applied Mathematics j=[Discrete Applied Mathematics] a=[ ] j-bytes=[68,105,115,99,114,101,116,101,32,65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115] | 2011-03-10 | Paper |
| Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays xxxAutomation and Remote Control j=[Automation and Remote Control] a=[ ] j-bytes=[65,117,116,111,109,97,116,105,111,110,32,97,110,100,32,82,101,109,111,116,101,32,67,111,110,116,114,111,108] | 2011-01-03 | Paper |
| The Routing Open Shop Problem: New Approximation Algorithms xxxApproximation and Online Algorithms j=[Approximation and Online Algorithms] a=[ ] j-bytes=[65,112,112,114,111,120,105,109,97,116,105,111,110,32,97,110,100,32,79,110,108,105,110,101,32,65,108,103,111,114,105,116,104,109,115] | 2010-05-11 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling xxxComputer Science - Theory and Applications j=[Computer Science - Theory and Applications] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101,32,45,32,84,104,101,111,114,121,32,97,110,100,32,65,112,112,108,105,99,97,116,105,111,110,115] | 2009-08-18 | Paper |
| Complete Complexity Classification of Short Shop Scheduling xxxComputer Science - Theory and Applications j=[Computer Science - Theory and Applications] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101,32,45,32,84,104,101,111,114,121,32,97,110,100,32,65,112,112,108,105,99,97,116,105,111,110,115] | 2009-08-18 | Paper |
| Approximation and Online Algorithms xxxLecture Notes in Computer Science j=[Lecture Notes in Computer Science] a=[ ] j-bytes=[76,101,99,116,117,114,101,32,78,111,116,101,115,32,105,110,32,67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101] | 2009-08-11 | Paper |
| The flow shop problem with no-idle constraints: a review and approximation xxxEuropean Journal of Operational Research j=[European Journal of Operational Research] a=[ ] j-bytes=[69,117,114,111,112,101,97,110,32,74,111,117,114,110,97,108,32,111,102,32,79,112,101,114,97,116,105,111,110,97,108,32,82,101,115,101,97,114,99,104] | 2009-06-30 | Paper |
| scientific article; zbMATH DE number 5540207 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2009-04-03 | Paper |
| On solvability of the project scheduling problem with accumulative resources of an arbitrary sign xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2009-01-20 | Paper |
| Open block scheduling in optical communication networks xxxTheoretical Computer Science j=[Theoretical Computer Science] a=[ ] j-bytes=[84,104,101,111,114,101,116,105,99,97,108,32,67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101] | 2006-09-14 | Paper |
| Algorithms – ESA 2005 xxxLecture Notes in Computer Science j=[Lecture Notes in Computer Science] a=[ ] j-bytes=[76,101,99,116,117,114,101,32,78,111,116,101,115,32,105,110,32,67,111,109,112,117,116,101,114,32,83,99,105,101,110,99,101] | 2006-06-27 | Paper |
| scientific article; zbMATH DE number 2239574 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2005-12-19 | Paper |
| An introduction to multi-parameter complexity analysis of discrete problems xxxEuropean Journal of Operational Research j=[European Journal of Operational Research] a=[ ] j-bytes=[69,117,114,111,112,101,97,110,32,74,111,117,114,110,97,108,32,111,102,32,79,112,101,114,97,116,105,111,110,97,108,32,82,101,115,101,97,114,99,104] | 2005-04-21 | Paper |
| Linear time approximation scheme for the multiprocessor open shop problem xxxDiscrete Applied Mathematics j=[Discrete Applied Mathematics] a=[ ] j-bytes=[68,105,115,99,114,101,116,101,32,65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115] | 2002-12-10 | Paper |
| Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage xxxJournal of Scheduling j=[Journal of Scheduling] a=[ ] j-bytes=[74,111,117,114,110,97,108,32,111,102,32,83,99,104,101,100,117,108,105,110,103] | 2002-08-08 | Paper |
| A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. xxxDiscrete Applied Mathematics j=[Discrete Applied Mathematics] a=[ ] j-bytes=[68,105,115,99,114,101,116,101,32,65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115] | 2002-01-30 | Paper |
| A polynomially solvable case of the two-stage open shop problem for three machines xxxDiskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 j=[Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1] a=[ ] j-bytes=[68,105,115,107,114,101,116,110,121,196,173,32,65,110,97,108,105,122,32,105,32,73,115,115,108,101,100,111,118,97,110,105,101,32,79,112,101,114,97,116,115,105,196,173,46,32,83,101,114,105,121,97,32,49] | 2001-07-22 | Paper |
| Four-parametric complexity analysis for an open shop problem xxxDiskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 j=[Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1] a=[ ] j-bytes=[68,105,115,107,114,101,116,110,121,196,173,32,65,110,97,108,105,122,32,105,32,73,115,115,108,101,100,111,118,97,110,105,101,32,79,112,101,114,97,116,115,105,196,173,46,32,83,101,114,105,121,97,32,49] | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1560545 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2001-02-04 | Paper |
| scientific article; zbMATH DE number 1560505 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2001-02-04 | Paper |
| scientific article; zbMATH DE number 1396582 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2000-01-31 | Paper |
| When difference in machine loads leads to efficient scheduling in open shops xxxAnnals of Operations Research j=[Annals of Operations Research] a=[ ] j-bytes=[65,110,110,97,108,115,32,111,102,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2000-01-11 | Paper |
| scientific article; zbMATH DE number 1305102 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1999-06-17 | Paper |
| Makespan minimization in open shops: A polynomial time approximation scheme xxxMathematical Programming. Series A. Series B j=[Mathematical Programming. Series A. Series B] a=[ ] j-bytes=[77,97,116,104,101,109,97,116,105,99,97,108,32,80,114,111,103,114,97,109,109,105,110,103,46,32,83,101,114,105,101,115,32,65,46,32,83,101,114,105,101,115,32,66] | 1999-06-03 | Paper |
| Nonstrict vector summation in multi-operation scheduling xxxAnnals of Operations Research j=[Annals of Operations Research] a=[ ] j-bytes=[65,110,110,97,108,115,32,111,102,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 1999-03-07 | Paper |
| On-line and off-line approximation algorithms for vector covering problems xxxAlgorithmica j=[Algorithmica] a=[ ] j-bytes=[65,108,103,111,114,105,116,104,109,105,99,97] | 1998-10-01 | Paper |
| Short Shop Schedules xxxOperations Research j=[Operations Research] a=[ ] j-bytes=[79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 1998-07-06 | Paper |
| Makespan minimization in preemptive two machine job shops xxxComputing j=[Computing] a=[ ] j-bytes=[67,111,109,112,117,116,105,110,103] | 1998-06-02 | Paper |
| To the Steinitz lemma in coordinate form xxxDiscrete Mathematics j=[Discrete Mathematics] a=[ ] j-bytes=[68,105,115,99,114,101,116,101,32,77,97,116,104,101,109,97,116,105,99,115] | 1997-08-26 | Paper |
| A polynomial-time open-shop problem with an arbitrary number of machines xxxCybernetics and Systems Analysis j=[Cybernetics and Systems Analysis] a=[ ] j-bytes=[67,121,98,101,114,110,101,116,105,99,115,32,97,110,100,32,83,121,115,116,101,109,115,32,65,110,97,108,121,115,105,115] | 1997-01-20 | Paper |
| scientific article; zbMATH DE number 850331 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1996-09-15 | Paper |
| scientific article; zbMATH DE number 919274 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1996-08-25 | Paper |
| scientific article; zbMATH DE number 808800 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1996-03-17 | Paper |
| scientific article; zbMATH DE number 808808 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1996-03-17 | Paper |
| The Two-Stage Assembly Scheduling Problem: Complexity and Approximation xxxOperations Research j=[Operations Research] a=[ ] j-bytes=[79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 1995-09-25 | Paper |
| Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops xxxMathematics of Operations Research j=[Mathematics of Operations Research] a=[ ] j-bytes=[77,97,116,104,101,109,97,116,105,99,115,32,111,102,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 1995-06-14 | Paper |
| On some geometric methods in scheduling theory: A survey xxxDiscrete Applied Mathematics j=[Discrete Applied Mathematics] a=[ ] j-bytes=[68,105,115,99,114,101,116,101,32,65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115] | 1995-04-03 | Paper |
| Vector summation within minimal angle xxxComputational Geometry j=[Computational Geometry] a=[ ] j-bytes=[67,111,109,112,117,116,97,116,105,111,110,97,108,32,71,101,111,109,101,116,114,121] | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 165470 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 22820 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4184280 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4108474 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1988-01-01 | Paper |
| Bounding algorithm for the routing problem with arbitrary paths and alternative servers xxxCybernetics j=[Cybernetics] a=[ ] j-bytes=[67,121,98,101,114,110,101,116,105,99,115] | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3941251 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3896632 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3841604 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3748435 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1981-01-01 | Paper |
| Value of the Steinitz constant xxxFunctional Analysis and Its Applications j=[Functional Analysis and Its Applications] a=[ ] j-bytes=[70,117,110,99,116,105,111,110,97,108,32,65,110,97,108,121,115,105,115,32,97,110,100,32,73,116,115,32,65,112,112,108,105,99,97,116,105,111,110,115] | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3788364 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3674746 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3737695 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3711748 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3708084 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3673844 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3648725 (Why is no real title available?) xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 1975-01-01 | Paper |
Research outcomes over time
This page was built for person: Sergey Sevastyanov
