Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Vitaly A. Strusevich
@article{DBLP:journals/scheduling/ShiouraSS24,
author = {Akiyoshi Shioura and
Vitaly A. Strusevich and
Natalia V. Shakhlevich},
title = {Preemptive scheduling of parallel jobs of two sizes with controllable
processing times},
journal = {J. Sched.},
volume = {27},
number = {2},
pages = {203--224},
year = {2024},
url = {https://doi.org/10.1007/s10951-023-00782-w},
doi = {10.1007/S10951-023-00782-W},
timestamp = {Sun, 14 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ShiouraSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejtl/KellererS23,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {The two-flight low risk helicopter transportation problem under the
split pickup scenario},
journal = {{EURO} J. Transp. Logist.},
volume = {12},
pages = {100115},
year = {2023},
url = {https://doi.org/10.1016/j.ejtl.2023.100115},
doi = {10.1016/J.EJTL.2023.100115},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejtl/KellererS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LenstraSV23,
author = {Jan Karel Lenstra and
Vitaly A. Strusevich and
Milan Vlach},
title = {A historical note on the complexity of scheduling problems},
journal = {Oper. Res. Lett.},
volume = {51},
number = {1},
pages = {1--2},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2022.11.006},
doi = {10.1016/J.ORL.2022.11.006},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LenstraSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChenS23,
author = {Bo Chen and
Vitaly A. Strusevich},
title = {An {FPTAS} for scheduling with resource constraints},
journal = {Oper. Res. Lett.},
volume = {51},
number = {4},
pages = {421--424},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.06.001},
doi = {10.1016/J.ORL.2023.06.001},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChenS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Strusevich22,
author = {Vitaly A. Strusevich},
title = {Complexity and approximation of open shop scheduling to minimize the
makespan: {A} review of models and approaches},
journal = {Comput. Oper. Res.},
volume = {144},
pages = {105732},
year = {2022},
url = {https://doi.org/10.1016/j.cor.2022.105732},
doi = {10.1016/J.COR.2022.105732},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/Strusevich22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/SoperS22,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Preemptive and non-preemptive scheduling on two unrelated parallel
machines},
journal = {J. Sched.},
volume = {25},
number = {6},
pages = {659--674},
year = {2022},
url = {https://doi.org/10.1007/s10951-022-00753-7},
doi = {10.1007/S10951-022-00753-7},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/SoperS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/SoperS21,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Parametric analysis of the quality of single preemption schedules
on three uniform parallel machines},
journal = {Ann. Oper. Res.},
volume = {298},
number = {1},
pages = {469--495},
year = {2021},
url = {https://doi.org/10.1007/s10479-018-2952-6},
doi = {10.1007/S10479-018-2952-6},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/SoperS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/Strusevich21,
author = {Vitaly A. Strusevich},
title = {Approximation algorithms for makespan minimization on identical parallel
machines under resource constraints},
journal = {J. Oper. Res. Soc.},
volume = {72},
number = {9},
pages = {2135--2146},
year = {2021},
url = {https://doi.org/10.1080/01605682.2020.1772019},
doi = {10.1080/01605682.2020.1772019},
timestamp = {Tue, 19 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/Strusevich21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/MosheiovSS20,
author = {Gur Mosheiov and
Assaf Sarig and
Vitaly A. Strusevich},
title = {Minmax scheduling and due-window assignment with position-dependent
processing times and job rejection},
journal = {4OR},
volume = {18},
number = {4},
pages = {439--456},
year = {2020},
url = {https://doi.org/10.1007/s10288-019-00418-w},
doi = {10.1007/S10288-019-00418-W},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/MosheiovSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/ShiouraSS20,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Scheduling problems with controllable processing times and a common
deadline to minimize maximum compression cost},
journal = {J. Glob. Optim.},
volume = {76},
number = {3},
pages = {471--490},
year = {2020},
url = {https://doi.org/10.1007/s10898-018-0686-2},
doi = {10.1007/S10898-018-0686-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/ShiouraSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/SoperS20,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Refined conditions for V-shaped optimal sequencing on a single machine
to minimize total completion time under combined effects},
journal = {J. Sched.},
volume = {23},
number = {6},
pages = {665--680},
year = {2020},
url = {https://doi.org/10.1007/s10951-019-00628-4},
doi = {10.1007/S10951-019-00628-4},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/SoperS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SoperS19,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Schedules with a single preemption on uniform parallel machines},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {332--343},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.007},
doi = {10.1016/J.DAM.2018.03.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SoperS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/motor/2019-2,
editor = {Igor A. Bykadorov and
Vitaly A. Strusevich and
Tatiana V. Tchemisova},
title = {Mathematical Optimization Theory and Operations Research - 18th International
Conference, {MOTOR} 2019, Ekaterinburg, Russia, July 8-12, 2019, Revised
Selected Papers},
series = {Communications in Computer and Information Science},
volume = {1090},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-33394-2},
doi = {10.1007/978-3-030-33394-2},
isbn = {978-3-030-33393-5},
timestamp = {Fri, 01 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/motor/2019-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/SilvaEBS18,
author = {Marcos de Melo da Silva and
G{\"{u}}nes Erdogan and
Maria Battarra and
Vitaly A. Strusevich},
title = {The Block Retrieval Problem},
journal = {Eur. J. Oper. Res.},
volume = {265},
number = {3},
pages = {931--950},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.08.048},
doi = {10.1016/J.EJOR.2017.08.048},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/SilvaEBS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ShiouraSS18,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Preemptive models of scheduling with controllable processing times
and of scheduling with imprecise computation: {A} review of solution
approaches},
journal = {Eur. J. Oper. Res.},
volume = {266},
number = {3},
pages = {795--818},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.08.034},
doi = {10.1016/J.EJOR.2017.08.034},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ShiouraSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HalmanKS18,
author = {Nir Halman and
Hans Kellerer and
Vitaly A. Strusevich},
title = {Approximation schemes for non-separable non-linear boolean programming
problems under nested knapsack constraints},
journal = {Eur. J. Oper. Res.},
volume = {270},
number = {2},
pages = {435--447},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2018.04.013},
doi = {10.1016/J.EJOR.2018.04.013},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HalmanKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MosheiovSSM18,
author = {Gur Mosheiov and
Assaf Sarig and
Vitaly A. Strusevich and
Jonathan Mosheiff},
title = {Two-machine flow shop and open shop scheduling problems with a single
maintenance window},
journal = {Eur. J. Oper. Res.},
volume = {271},
number = {2},
pages = {388--400},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2018.04.019},
doi = {10.1016/J.EJOR.2018.04.019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/MosheiovSSM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ShiouraSSP18,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich and
Bernhard Primas},
title = {Models and algorithms for energy-efficient scheduling with immediate
start of jobs},
journal = {J. Sched.},
volume = {21},
number = {5},
pages = {505--516},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0552-y},
doi = {10.1007/S10951-017-0552-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ShiouraSSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BassoS17,
author = {Rebecca Sarto Basso and
Vitaly A. Strusevich},
title = {Differential approximation schemes for half-product related functions
and their scheduling applications},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {71--78},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.10.006},
doi = {10.1016/J.DAM.2015.10.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BassoS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ShiouraSS17,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Machine Speed Scaling by Adapting Methods for Convex Optimization
with Submodular Constraints},
journal = {{INFORMS} J. Comput.},
volume = {29},
number = {4},
pages = {724--736},
year = {2017},
url = {https://doi.org/10.1287/ijoc.2017.0758},
doi = {10.1287/IJOC.2017.0758},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/ShiouraSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/RustogiS17,
author = {Kabir Rustogi and
Vitaly A. Strusevich},
title = {Single machine scheduling with a generalized job-dependent cumulative
effect},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {583--592},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0497-6},
doi = {10.1007/S10951-016-0497-6},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/RustogiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EpsteinLSS17,
author = {Leah Epstein and
Asaf Levin and
Alan J. Soper and
Vitaly A. Strusevich},
title = {Power of Preemption for Minimizing Total Completion Time on Uniform
Parallel Machines},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {1},
pages = {101--123},
year = {2017},
url = {https://doi.org/10.1137/16M1066610},
doi = {10.1137/16M1066610},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EpsteinLSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KellererBS17,
author = {Hans Kellerer and
Rebecca Sarto Basso and
Vitaly A. Strusevich},
title = {Approximability issues for unconstrained and constrained maximization
of half-product related functions},
journal = {Theor. Comput. Sci.},
volume = {659},
pages = {64--71},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.11.009},
doi = {10.1016/J.TCS.2016.11.009},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KellererBS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/KellererS16,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Optimizing the half-product and related quadratic Boolean functions:
approximation and scheduling applications},
journal = {Ann. Oper. Res.},
volume = {240},
number = {1},
pages = {39--94},
year = {2016},
url = {https://doi.org/10.1007/s10479-015-2018-y},
doi = {10.1007/S10479-015-2018-Y},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/KellererS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ShiouraSS16,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Application of Submodular Optimization to Single Machine Scheduling
with Controllable Processing Times Subject to Release Dates and Deadlines},
journal = {{INFORMS} J. Comput.},
volume = {28},
number = {1},
pages = {148--161},
year = {2016},
url = {https://doi.org/10.1287/ijoc.2015.0660},
doi = {10.1287/IJOC.2015.0660},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/ShiouraSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/door/ShiouraSS16,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
editor = {Yury Kochetov and
Michael Yu. Khachay and
Vladimir L. Beresnev and
Evgeni A. Nurminski and
Panos M. Pardalos},
title = {Handling Scheduling Problems with Controllable Parameters by Methods
of Submodular Optimization},
booktitle = {Discrete Optimization and Operations Research - 9th International
Conference, {DOOR} 2016, Vladivostok, Russia, September 19-23, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9869},
pages = {74--90},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44914-2\_7},
doi = {10.1007/978-3-319-44914-2\_7},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/door/ShiouraSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/RustogiS15,
author = {Kabir Rustogi and
Vitaly A. Strusevich},
title = {Single machine scheduling with time-dependent linear deterioration
and rate-modifying maintenance},
journal = {J. Oper. Res. Soc.},
volume = {66},
number = {3},
pages = {500--515},
year = {2015},
url = {https://doi.org/10.1057/jors.2014.18},
doi = {10.1057/JORS.2014.18},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/RustogiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ShiouraSS15,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Decomposition algorithms for submodular optimization with applications
to parallel machine scheduling with controllable processing times},
journal = {Math. Program.},
volume = {153},
number = {2},
pages = {495--534},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0814-9},
doi = {10.1007/S10107-014-0814-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ShiouraSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/QuibellS14,
author = {Richard Quibell and
Vitaly A. Strusevich},
title = {An approximation algorithm for the three-machine scheduling problem
with the routes given by the same partial order},
journal = {Comput. Ind. Eng.},
volume = {76},
pages = {347--359},
year = {2014},
url = {https://doi.org/10.1016/j.cie.2014.08.009},
doi = {10.1016/J.CIE.2014.08.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/QuibellS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/SoperS14,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Single parameter analysis of power of preemption on two and three
uniform machines},
journal = {Discret. Optim.},
volume = {12},
pages = {26--46},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2013.12.004},
doi = {10.1016/J.DISOPT.2013.12.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/SoperS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SoperS14,
author = {Alan J. Soper and
Vitaly A. Strusevich},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Power of Preemption on Uniform Parallel Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {392--402},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.392},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.392},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/SoperS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/EscuderoMS13,
author = {Laureano F. Escudero and
Silvano Martello and
Vitaly A. Strusevich},
title = {An overview of computational issues in combinatorial optimization},
journal = {Ann. Oper. Res.},
volume = {207},
number = {1},
pages = {1--5},
year = {2013},
url = {https://doi.org/10.1007/s10479-013-1400-x},
doi = {10.1007/S10479-013-1400-X},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/EscuderoMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KellererS13,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Fast approximation schemes for Boolean programming and scheduling
problems related to positive convex Half-Product},
journal = {Eur. J. Oper. Res.},
volume = {228},
number = {1},
pages = {24--32},
year = {2013},
url = {https://doi.org/10.1016/j.ejor.2012.12.028},
doi = {10.1016/J.EJOR.2012.12.028},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KellererS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/RustogiS13,
author = {Kabir Rustogi and
Vitaly A. Strusevich},
title = {Parallel Machine Scheduling: Impact of Adding Extra Machines},
journal = {Oper. Res.},
volume = {61},
number = {5},
pages = {1243--1257},
year = {2013},
url = {https://doi.org/10.1287/opre.2013.1208},
doi = {10.1287/OPRE.2013.1208},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/RustogiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererSS13,
author = {Hans Kellerer and
Alan J. Soper and
Vitaly A. Strusevich},
title = {Preemptive scheduling on two identical parallel machines with a single
transporter},
journal = {J. Comb. Optim.},
volume = {25},
number = {2},
pages = {279--307},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9511-x},
doi = {10.1007/S10878-012-9511-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/KellererRS13,
author = {Hans Kellerer and
Kabir Rustogi and
Vitaly A. Strusevich},
title = {Approximation schemes for scheduling on a single machine subject to
cumulative deterioration and maintenance},
journal = {J. Sched.},
volume = {16},
number = {6},
pages = {675--683},
year = {2013},
url = {https://doi.org/10.1007/s10951-012-0287-8},
doi = {10.1007/S10951-012-0287-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/KellererRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ShiouraSS13,
author = {Akiyoshi Shioura and
Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {A Submodular Optimization Approach to Bicriteria Scheduling Problems
with Controllable Processing Times on Parallel Machines},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {186--204},
year = {2013},
url = {https://doi.org/10.1137/110843836},
doi = {10.1137/110843836},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ShiouraSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/KellererS12,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {The symmetric quadratic knapsack problem: approximation and scheduling
applications},
journal = {4OR},
volume = {10},
number = {2},
pages = {111--161},
year = {2012},
url = {https://doi.org/10.1007/s10288-011-0180-x},
doi = {10.1007/S10288-011-0180-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/KellererS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/DolguiGS12,
author = {Alexandre Dolgui and
Valery S. Gordon and
Vitaly A. Strusevich},
title = {Single machine scheduling with precedence constraints and positionally
dependent processing times},
journal = {Comput. Oper. Res.},
volume = {39},
number = {6},
pages = {1218--1224},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2010.06.004},
doi = {10.1016/J.COR.2010.06.004},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/DolguiGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/RustogiS12,
author = {Kabir Rustogi and
Vitaly A. Strusevich},
title = {Simple matching vs linear assignment in scheduling models with positional
effects: {A} critical review},
journal = {Eur. J. Oper. Res.},
volume = {222},
number = {3},
pages = {393--407},
year = {2012},
url = {https://doi.org/10.1016/j.ejor.2012.04.037},
doi = {10.1016/J.EJOR.2012.04.037},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/RustogiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BlazewiczBGKSS12,
author = {Jacek Blazewicz and
Edmund K. Burke and
Valery S. Gordon and
Mikhail Y. Kovalyov and
Yakov M. Shafransky and
Vitaly A. Strusevich},
title = {Editorial: new branches, old roots},
journal = {J. Sched.},
volume = {15},
number = {4},
pages = {399--401},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0262-9},
doi = {10.1007/S10951-011-0262-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BlazewiczBGKSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GordonKLSSST12,
author = {Valery S. Gordon and
Mikhail Y. Kovalyov and
G. M. Levin and
Yakov M. Shafransky and
Yuri N. Sotskov and
Vitaly A. Strusevich and
Alexander V. Tuzikov},
title = {Vyacheslav Tanaev: contributions to scheduling and related areas},
journal = {J. Sched.},
volume = {15},
number = {4},
pages = {403--418},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0230-4},
doi = {10.1007/S10951-011-0230-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GordonKLSSST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GordonSD12,
author = {Valery S. Gordon and
Vitaly A. Strusevich and
Alexandre Dolgui},
title = {Scheduling with due date assignment under special conditions on job
processing},
journal = {J. Sched.},
volume = {15},
number = {4},
pages = {447--456},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0240-2},
doi = {10.1007/S10951-011-0240-2},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GordonSD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GordonOPS11,
author = {Valery S. Gordon and
Yury L. Orlovich and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Hamiltonian properties of locally connected graphs with bounded vertex
degree},
journal = {Discret. Appl. Math.},
volume = {159},
number = {16},
pages = {1759--1774},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.10.005},
doi = {10.1016/J.DAM.2010.10.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GordonOPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KellererS10,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack
Problem and its Scheduling Applications},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {769--795},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9248-1},
doi = {10.1007/S00453-008-9248-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KellererS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LushchakovaS10,
author = {Irina N. Lushchakova and
Vitaly A. Strusevich},
title = {Scheduling incompatible tasks on two machines},
journal = {Eur. J. Oper. Res.},
volume = {200},
number = {2},
pages = {334--346},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.01.029},
doi = {10.1016/J.EJOR.2009.01.029},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LushchakovaS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KellererS10,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Minimizing Total Weighted earliness-tardiness on a Single Machine
around a Small Common due date: an {FPTAS} Using Quadratic Knapsack},
journal = {Int. J. Found. Comput. Sci.},
volume = {21},
number = {3},
pages = {357--383},
year = {2010},
url = {https://doi.org/10.1142/S0129054110007301},
doi = {10.1142/S0129054110007301},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KellererS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KellererSS10,
author = {Hans Kellerer and
Alan J. Soper and
Vitaly A. Strusevich},
editor = {Weili Wu and
Ovidiu Daescu},
title = {Transporting Jobs through a Processing Center with Two Parallel Machines},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6508},
pages = {408--422},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17458-2\_33},
doi = {10.1007/978-3-642-17458-2\_33},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/KellererSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/BraunerFLRKPS09,
author = {Nadia Brauner and
Gerd Finke and
Vassilissa Lehoux{-}Lebacque and
Christophe Rapine and
Hans Kellerer and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Operator non-availability periods},
journal = {4OR},
volume = {7},
number = {3},
pages = {239--253},
year = {2009},
url = {https://doi.org/10.1007/s10288-008-0084-6},
doi = {10.1007/S10288-008-0084-6},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/BraunerFLRKPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/FinkeSW09,
author = {Gerd Finke and
Vitaly A. Strusevich and
Frank Werner},
title = {Guest Editorial},
journal = {Comput. Oper. Res.},
volume = {36},
number = {2},
pages = {299--300},
year = {2009},
url = {https://doi.org/10.1016/j.cor.2007.10.009},
doi = {10.1016/J.COR.2007.10.009},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/FinkeSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/KubzinPS09,
author = {Mikhail A. Kubzin and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Approximation results for flow shop scheduling problems with machine
availability constraints},
journal = {Comput. Oper. Res.},
volume = {36},
number = {2},
pages = {379--390},
year = {2009},
url = {https://doi.org/10.1016/j.cor.2007.10.013},
doi = {10.1016/J.COR.2007.10.013},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/KubzinPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GordonS09,
author = {Valery S. Gordon and
Vitaly A. Strusevich},
title = {Single machine scheduling and due date assignment with positionally
dependent processing times},
journal = {Eur. J. Oper. Res.},
volume = {198},
number = {1},
pages = {57--62},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.07.044},
doi = {10.1016/J.EJOR.2008.07.044},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GordonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KellererKS09,
author = {Hans Kellerer and
Mikhail A. Kubzin and
Vitaly A. Strusevich},
title = {Two simple constant ratio approximation algorithms for minimizing
the total weighted completion time on a single machine with a fixed
non-availability interval},
journal = {Eur. J. Oper. Res.},
volume = {199},
number = {1},
pages = {111--116},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.11.003},
doi = {10.1016/J.EJOR.2008.11.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KellererKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ShakhlevichSS09,
author = {Natalia V. Shakhlevich and
Akiyoshi Shioura and
Vitaly A. Strusevich},
title = {Single Machine Scheduling with Controllable Processing Times by submodular
Optimization},
journal = {Int. J. Found. Comput. Sci.},
volume = {20},
number = {2},
pages = {247--269},
year = {2009},
url = {https://doi.org/10.1142/S0129054109006541},
doi = {10.1142/S0129054109006541},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ShakhlevichSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/PottsS09,
author = {Chris N. Potts and
Vitaly A. Strusevich},
title = {Fifty years of scheduling: a survey of milestones},
journal = {J. Oper. Res. Soc.},
volume = {60},
number = {{S1}},
year = {2009},
url = {https://doi.org/10.1057/jors.2009.2},
doi = {10.1057/JORS.2009.2},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/PottsS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShakhlevichS08,
author = {Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Preemptive Scheduling on Uniform Parallel Machines with Controllable
Job Processing Times},
journal = {Algorithmica},
volume = {51},
number = {4},
pages = {451--473},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9091-9},
doi = {10.1007/S00453-007-9091-9},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShakhlevichS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GordonPSW08,
author = {Valery S. Gordon and
Chris N. Potts and
Vitaly A. Strusevich and
J. Douglass Whitehead},
title = {Single machine scheduling models with deterioration and learning:
handling precedence constraints via priority generation},
journal = {J. Sched.},
volume = {11},
number = {5},
pages = {357--370},
year = {2008},
url = {https://doi.org/10.1007/s10951-008-0064-x},
doi = {10.1007/S10951-008-0064-X},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GordonPSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ShakhlevichSS08,
author = {Natalia V. Shakhlevich and
Akiyoshi Shioura and
Vitaly A. Strusevich},
editor = {Dan Halperin and
Kurt Mehlhorn},
title = {Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems
with Controllable Processing Times - {A} Polymatroid Optimization
Approach},
booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
Germany, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5193},
pages = {756--767},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87744-8\_63},
doi = {10.1007/978-3-540-87744-8\_63},
timestamp = {Sun, 02 Jun 2019 21:14:36 +0200},
biburl = {https://dblp.org/rec/conf/esa/ShakhlevichSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/OrlovichGPS07,
author = {Yury L. Orlovich and
Valery S. Gordon and
Chris N. Potts and
Vitaly A. Strusevich},
title = {On Hamilton Cycles in Locally Connected Graphs with Vertex Degree
Constraints},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {169--173},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.028},
doi = {10.1016/J.ENDM.2007.07.028},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/OrlovichGPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SoperS07,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {An Improved Approximation Algorithm for the Two-Machine Flow Shop
Scheduling Problem with an interstage transporter},
journal = {Int. J. Found. Comput. Sci.},
volume = {18},
number = {3},
pages = {565--591},
year = {2007},
url = {https://doi.org/10.1142/S012905410700484X},
doi = {10.1142/S012905410700484X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/SoperS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShakhlevichS06,
author = {Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Single machine scheduling with controllable release and processing
parameters},
journal = {Discret. Appl. Math.},
volume = {154},
number = {15},
pages = {2178--2199},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.04.014},
doi = {10.1016/J.DAM.2005.04.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShakhlevichS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/KubzinS06,
author = {Mikhail A. Kubzin and
Vitaly A. Strusevich},
title = {Planning Machine Maintenance in Two-Machine Shop Scheduling},
journal = {Oper. Res.},
volume = {54},
number = {4},
pages = {789--800},
year = {2006},
url = {https://doi.org/10.1287/opre.1060.0301},
doi = {10.1287/OPRE.1060.0301},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/KubzinS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GribkovskaiaLSW06,
author = {Irina V. Gribkovskaia and
Chung{-}Yee Lee and
Vitaly A. Strusevich and
Dominique de Werra},
title = {Three is easy, two is hard: open shop sum-batch scheduling problem
refined},
journal = {Oper. Res. Lett.},
volume = {34},
number = {4},
pages = {459--464},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.07.006},
doi = {10.1016/J.ORL.2005.07.006},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GribkovskaiaLSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KellererS06,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {A fully polynomial approximation scheme for the single machine weighted
total tardiness problem with a common due date},
journal = {Theor. Comput. Sci.},
volume = {369},
number = {1-3},
pages = {230--238},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.08.030},
doi = {10.1016/J.TCS.2006.08.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KellererS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/KubzinS05,
author = {Mikhail A. Kubzin and
Vitaly A. Strusevich},
title = {Two-machine flow shop no-wait scheduling with machine maintenance},
journal = {4OR},
volume = {3},
number = {4},
pages = {303--313},
year = {2005},
url = {https://doi.org/10.1007/s10288-005-0070-1},
doi = {10.1007/S10288-005-0070-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/KubzinS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/EssweinBS05,
author = {Carl Esswein and
Jean{-}Charles Billaut and
Vitaly A. Strusevich},
title = {Two-machine shop scheduling: Compromise between flexibility and makespan
value},
journal = {Eur. J. Oper. Res.},
volume = {167},
number = {3},
pages = {796--809},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.01.029},
doi = {10.1016/J.EJOR.2004.01.029},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/EssweinBS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Strusevich05,
author = {Vitaly A. Strusevich},
title = {Hans Kellerer, Ulrich Pferschy and David Pisinger, \emph{Knapsack
Problems}, Springer, Berlin {(2004)} {ISBN} 3-540-40286-1 546pp.,
{EUR} 99, 95},
journal = {Oper. Res. Lett.},
volume = {33},
number = {2},
pages = {217--219},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.07.002},
doi = {10.1016/J.ORL.2004.07.002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Strusevich05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BouquardBKS05,
author = {Jean{-}Louis Bouquard and
Jean{-}Charles Billaut and
Mikhail A. Kubzin and
Vitaly A. Strusevich},
title = {Two-machine flow shop scheduling problems with no-wait jobs},
journal = {Oper. Res. Lett.},
volume = {33},
number = {3},
pages = {255--262},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.06.003},
doi = {10.1016/J.ORL.2004.06.003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BouquardBKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ShakhlevichS05,
author = {Natalia V. Shakhlevich and
Vitaly A. Strusevich},
title = {Pre-Emptive Scheduling Problems with Controllable Processing Times},
journal = {J. Sched.},
volume = {8},
number = {3},
pages = {233--253},
year = {2005},
url = {https://doi.org/10.1007/s10951-005-6813-1},
doi = {10.1007/S10951-005-6813-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ShakhlevichS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GuptaKKPS04,
author = {Jatinder N. D. Gupta and
Christos Koulamas and
George J. Kyparisis and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize
Makespan},
journal = {Ann. Oper. Res.},
volume = {129},
number = {1-4},
pages = {171--185},
year = {2004},
url = {https://doi.org/10.1023/B:ANOR.0000030687.72169.c7},
doi = {10.1023/B:ANOR.0000030687.72169.C7},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/GuptaKKPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KovalyovPS04,
author = {Mikhail Y. Kovalyov and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Batching decisions for assembly production systems},
journal = {Eur. J. Oper. Res.},
volume = {157},
number = {3},
pages = {620--642},
year = {2004},
url = {https://doi.org/10.1016/S0377-2217(03)00250-9},
doi = {10.1016/S0377-2217(03)00250-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KovalyovPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GladkySS04,
author = {Andrei A. Gladky and
Yakov M. Shafransky and
Vitaly A. Strusevich},
title = {Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {13--28},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021935.66577.09},
doi = {10.1023/B:JOCO.0000021935.66577.09},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GladkySS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/GordonPS04,
author = {Valery S. Gordon and
Jean{-}Marie Proth and
Vitaly A. Strusevich},
editor = {Joseph Y.{-}T. Leung},
title = {Scheduling with Due Date Assignment},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch21},
doi = {10.1201/9780203489802.CH21},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/GordonPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EgleseEPS03,
author = {Richard W. Eglese and
Martin G. Everett and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Preface: International Symposium on Combinatorial Optimisation},
journal = {Discret. Appl. Math.},
volume = {133},
number = {1-3},
pages = {1--2},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00430-X},
doi = {10.1016/S0166-218X(03)00430-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EgleseEPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KellererS03,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Scheduling problems for parallel dedicated machines under multiple
resource constraints},
journal = {Discret. Appl. Math.},
volume = {133},
number = {1-3},
pages = {45--68},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00433-5},
doi = {10.1016/S0166-218X(03)00433-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KellererS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KellererS03,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Scheduling parallel dedicated machines under a single non-shared resource},
journal = {Eur. J. Oper. Res.},
volume = {147},
number = {2},
pages = {345--364},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00246-1},
doi = {10.1016/S0377-2217(02)00246-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KellererS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BreitSS03,
author = {Joachim Breit and
G{\"{u}}nter Schmidt and
Vitaly A. Strusevich},
title = {Non-preemptive two-machine open shop scheduling with non-availability
constraints},
journal = {Math. Methods Oper. Res.},
volume = {57},
number = {2},
pages = {217--234},
year = {2003},
url = {https://doi.org/10.1007/s001860200267},
doi = {10.1007/S001860200267},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BreitSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/StrusevichDS02,
author = {Vitaly A. Strusevich and
Inna G. Drobouchevitch and
Natalia V. Shakhlevich},
title = {Three-machine shop scheduling with partially ordered processing routes},
journal = {J. Oper. Res. Soc.},
volume = {53},
number = {5},
pages = {574--582},
year = {2002},
url = {https://doi.org/10.1057/palgrave.jors.2601329},
doi = {10.1057/PALGRAVE.JORS.2601329},
timestamp = {Mon, 24 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/StrusevichDS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DrobouchevitchS01,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {Two-stage open shop scheduling with a bottleneck machine},
journal = {Eur. J. Oper. Res.},
volume = {128},
number = {1},
pages = {159--174},
year = {2001},
url = {https://doi.org/10.1016/S0377-2217(99)00356-2},
doi = {10.1016/S0377-2217(99)00356-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DrobouchevitchS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/GlassPS01,
author = {Celia A. Glass and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Scheduling Batches with Sequential Job Processing for Two-Machine
Flow and Open Shops},
journal = {{INFORMS} J. Comput.},
volume = {13},
number = {2},
pages = {120--137},
year = {2001},
url = {https://doi.org/10.1287/ijoc.13.2.120.10521},
doi = {10.1287/IJOC.13.2.120.10521},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/GlassPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BreitSS01,
author = {Joachim Breit and
G{\"{u}}nter Schmidt and
Vitaly A. Strusevich},
title = {Two-machine open shop scheduling with an availability constraint},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {65--77},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00079-7},
doi = {10.1016/S0167-6377(01)00079-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BreitSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DrobouchevitchS00,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {Heuristics for the two-stage job shop scheduling problem with a bottleneck
machine},
journal = {Eur. J. Oper. Res.},
volume = {123},
number = {2},
pages = {229--240},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00253-2},
doi = {10.1016/S0377-2217(99)00253-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DrobouchevitchS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Strusevich00,
author = {Vitaly A. Strusevich},
title = {Group technology approach to the open shop scheduling problem with
batch setup times},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {181--192},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00021-3},
doi = {10.1016/S0167-6377(00)00021-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Strusevich00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DrobouchevitchS99,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {A heuristic algorithm for two-machine re-entrant shop scheduling},
journal = {Ann. Oper. Res.},
volume = {86},
pages = {417--439},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018927407164},
doi = {10.1023/A\%3A1018927407164},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/DrobouchevitchS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DrobouchevitchS99a,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {A polynomial algorithm for the three-machineopen shop with a bottleneck
machine},
journal = {Ann. Oper. Res.},
volume = {92},
pages = {185--210},
year = {1999},
url = {https://doi.org/10.1023/A\%3A1018982630730},
doi = {10.1023/A\%3A1018982630730},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/DrobouchevitchS99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GordonS99,
author = {Valery S. Gordon and
Vitaly A. Strusevich},
title = {Earliness penalties on a single machine subject to precedence constraints:
{SLK} due date assignment},
journal = {Comput. Oper. Res.},
volume = {26},
number = {2},
pages = {157--177},
year = {1999},
url = {https://doi.org/10.1016/S0305-0548(98)00055-0},
doi = {10.1016/S0305-0548(98)00055-0},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/GordonS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Strusevich99,
author = {Vitaly A. Strusevich},
title = {A Heuristic for the Two-machine Open-shop Scheduling Problem with
Transportation Times},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {287--304},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00115-8},
doi = {10.1016/S0166-218X(99)00115-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Strusevich99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/StrusevichWD99,
author = {Vitaly A. Strusevich and
A. J. A. van de Waart and
Rommert Dekker},
title = {A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing
Times},
journal = {J. Heuristics},
volume = {5},
number = {1},
pages = {5--28},
year = {1999},
url = {https://doi.org/10.1023/A:1009643112214},
doi = {10.1023/A:1009643112214},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/StrusevichWD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/RebaineS99,
author = {Djamal Rebaine and
Vitaly A. Strusevich},
title = {Two-machine open shop scheduling with special transportation times},
journal = {J. Oper. Res. Soc.},
volume = {50},
number = {7},
pages = {756--764},
year = {1999},
url = {https://doi.org/10.1057/palgrave.jors.2600769},
doi = {10.1057/PALGRAVE.JORS.2600769},
timestamp = {Fri, 04 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/RebaineS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Strusevich98,
author = {Vitaly A. Strusevich},
title = {A greedy open shop heuristic with job priorities},
journal = {Ann. Oper. Res.},
volume = {83},
pages = {253--270},
year = {1998},
url = {https://doi.org/10.1023/A\%3A1018964131329},
doi = {10.1023/A\%3A1018964131329},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Strusevich98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/DrobouchevitchS98,
author = {Inna G. Drobouchevitch and
Vitaly A. Strusevich},
title = {Heuristics for short route job shop scheduling problems},
journal = {Math. Methods Oper. Res.},
volume = {48},
number = {3},
pages = {359--375},
year = {1998},
url = {https://doi.org/10.1007/s001860050033},
doi = {10.1007/S001860050033},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/DrobouchevitchS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenPS98,
author = {Bo Chen and
Chris N. Potts and
Vitaly A. Strusevich},
title = {Approximation algorithms for two-machine flow shop scheduling with
batch setup times},
journal = {Math. Program.},
volume = {82},
pages = {255--271},
year = {1998},
url = {https://doi.org/10.1007/BF01585875},
doi = {10.1007/BF01585875},
timestamp = {Wed, 21 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ChenPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Strusevich97,
author = {Vitaly A. Strusevich},
title = {Shop scheduling problems under precedence constraints},
journal = {Ann. Oper. Res.},
volume = {69},
pages = {351--377},
year = {1997},
url = {https://doi.org/10.1023/A\%3A1018997431986},
doi = {10.1023/A\%3A1018997431986},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Strusevich97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GuptaSZ97,
author = {Jatinder N. D. Gupta and
Vitaly A. Strusevich and
Carin M. Zwaneveld},
title = {Two-stage no-wait scheduling models with setup and removal times separated},
journal = {Comput. Oper. Res.},
volume = {24},
number = {11},
pages = {1025--1031},
year = {1997},
url = {https://doi.org/10.1016/S0305-0548(97)00018-X},
doi = {10.1016/S0305-0548(97)00018-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/GuptaSZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/StrusevichH97,
author = {Vitaly A. Strusevich and
L. A. Hall},
title = {An open shop scheduling problem with a non-bottleneck machine},
journal = {Oper. Res. Lett.},
volume = {21},
number = {1},
pages = {11--18},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(97)00030-8},
doi = {10.1016/S0167-6377(97)00030-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/StrusevichH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ChenGPS96,
author = {Bo Chen and
Celia A. Glass and
Chris N. Potts and
Vitaly A. Strusevich},
title = {A New Heuristic for Three-Machine Flow Shop Scheduling},
journal = {Oper. Res.},
volume = {44},
number = {6},
pages = {891--898},
year = {1996},
url = {https://doi.org/10.1287/opre.44.6.891},
doi = {10.1287/OPRE.44.6.891},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ChenGPS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Strusevich95,
author = {Vitaly A. Strusevich},
title = {Two Machine Flow Shop Scheduling Problem with No Wait in Process:
Controllable Machine Speeds},
journal = {Discret. Appl. Math.},
volume = {59},
number = {1},
pages = {75--86},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(93)E0153-P},
doi = {10.1016/0166-218X(93)E0153-P},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Strusevich95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/PottsSSWZ95,
author = {Chris N. Potts and
S. V. Sevast'janov and
Vitaly A. Strusevich and
Luk N. Van Wassenhove and
Carin M. Zwaneveld},
title = {The Two-Stage Assembly Scheduling Problem: Complexity and Approximation},
journal = {Oper. Res.},
volume = {43},
number = {2},
pages = {346--355},
year = {1995},
url = {https://doi.org/10.1287/opre.43.2.346},
doi = {10.1287/OPRE.43.2.346},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/PottsSSWZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/StrusevichZ94,
author = {Vitaly A. Strusevich and
Carin M. Zwaneveld},
title = {On non-permutation solutions to some two machine flow shop scheduling
problems},
journal = {Math. Methods Oper. Res.},
volume = {39},
number = {3},
pages = {305--319},
year = {1994},
url = {https://doi.org/10.1007/BF01435460},
doi = {10.1007/BF01435460},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/StrusevichZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Strusevich93,
author = {Vitaly A. Strusevich},
title = {Two machine open shop scheduling problem with setup, processing and
removal times separated},
journal = {Comput. Oper. Res.},
volume = {20},
number = {6},
pages = {597--611},
year = {1993},
url = {https://doi.org/10.1016/0305-0548(93)90115-Y},
doi = {10.1016/0305-0548(93)90115-Y},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Strusevich93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ChenS93,
author = {Bo Chen and
Vitaly A. Strusevich},
title = {Approximation Algorithms for Three-Machine Open Shop Scheduling},
journal = {{INFORMS} J. Comput.},
volume = {5},
number = {3},
pages = {321--326},
year = {1993},
url = {https://doi.org/10.1287/ijoc.5.3.321},
doi = {10.1287/IJOC.5.3.321},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/ChenS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-15 20:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
