Vitaly Strusevich Ph.D.
Professor of Operational Research

Recent Publications

Books

V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich.  Scheduling Theory. Multi-Stage Systems. Nauka Publishers, Moscow, 1989 (in Russian) {translated into English by Kluwer Academic Publishers, the Netherlands, 1994}.

V.A. Strusevich. Complexity Aspects of Shop Scheduling Problems, Erasmus University Rotterdam, 1991.

Y. N. Sotskov, V.A. Strusevich, V. S. Tanaev. Mathematical Models and Methods of Calendar Planning (a textbook for Applied Mathematics students), Universitetskoe, Minsk,1994 (in Russian).
 

Edited Volumes

  1. Models and Algorithms for Planning and Scheduling Problems: Cambridge Workshop, Annals of Operations Research, 1999, Vol. 92, 404 pp. Guest editors: C.A. Glass, C.N. Potts, V.A. Strusevich and R.R. Weber.

  2. International Symposium on Combinatorial Optimisation. Discrete Applied Mathematics, 2003, Vol. 133, No 1-3. Co-editors: R.W. Eglese, M.G. Everett, C.N. Potts and V.A. Strusevich.

  3. International Symposium on Combinatorial Optimization CO’02. Discrete Applied Mathematics, 2006, Vol. 154, Issue 15, Pages 2041-2223.  Co-editor: P. Chretienne and V.A. Strusevich.

  4. Scheduling for Modern Manufacturing, Logistics, and Supply Chains. Computers & Operations Research, 2009, vol. 36, Issue 2. Co-editors: G. Finke, V.A. Strusevich and F. Werner.

    5.  

Papers (2008 - )

  1. A. Dolgui, V. Gordon and V. Strusevich. Single machine scheduling with precedence constraints and positionally dependent processing times. Computers & Operations Research, 2012, 39, 1218-1224, doi:10.1016/j.cor.2010.06.004

  2. I. Kacem, H. Kellerer, V.A. Strusevich. Single machine scheduling with a common due date: Total weighted tardiness problems. In: A.R. Ahjoub (ed.) Progress in Combinatorial Optimization, Chapter 13, Wiley-ISTE, 2011.  

  3. V.S. Gordon, Y.L. Orlovich, C.N. Potts, V.A. Strusevich. Hamiltonian properties of locally connected graphs with bounded vertex degree. Discrete Applied Mathematics, 2011, 159, 1759-1774,  doi:10.1016/j.dam.2010.10.005

  4. K. Rustogi and V.A. Strusevich. Convex and V-shaped sequences of sums of functions that depend on ceiling functions. Journal of Integer Sequences, 2011, 14, Article 11.1.5. http://www.cs.uwaterloo.ca/journals/JIS/VOL14/Strusevich/strusevich2.html

  5. H. Kellerer, A.J. Soper and V.A. Strusevich. Transporting jobs through a processing center with two parallel machines. Lecture Notes in Computer Science, 2010, 6508, 408-422.

  6. V.S. Gordon, A. Dolgui and V.A. Strusevich. Schedules with precedence restriction and position-dependent servicing durability. Doklady of the National Academy of Sciences of Belarus, 2010, 54(4), 47-52 (in Russian).

  7. V. S. Gordon, M. Ya. Kovalyov, G. M. Levin, Yu. N. Sotskov, A. V. Tuzikov, V.A. Strusevich and Ya. M. Shafransky. Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary. Automation and Remote Control, 2010, 71 (10), 2021-2028 (translated from Russian Automatika i Telemekhanika, 2010, No 10, 6-14).

  8. H. Kellerer and V.A. Strusevich. Minimizing total weighted earliness-tardiness on a single machine around a small common due date: An FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science, 2010, 21, 357-383, doi:10.1142/S0129054110007301

  9. H. Kellerer and V.A. Strusevich. Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 2010, 57, 769-795, doi:10.1007/s00453-008-9248-1.

  10. I.N. Lushchakova and V.A. Strusevich. Scheduling incompatible tasks on two machines. European Journal of Operational Research, 2010, 200, 334-346. doi:10.1016/j.ejor.2009.01.029

  11. N. Brauner, G.Finke, V. Lehoux-Lebacque, C. Rapine, H. Kellerer, C.N. Potts and V.A. Strusevich. Operator non-availability periods. 4OR, 2009, 7, 239-253 doi:10.1007/s10288-008-0084-6

  12. V.S. Gordon and V.A. Strusevich. Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 2009: 198, 57-62. doi:10.1016/j.ejor.2008.07.044

  13. M.A. Kubzin, C.N. Potts and V.A. Strusevich. Approximation results for flow shop scheduling problems with machine availability constraints. Computers & Operations Research, 2009: 36 379-390, doi:10.1016/j.cor.2007.10.013

  14. I.N. Lushchakova, A.J. Soper and V.A. Strusevich. Transporting jobs through a two-machine open shop. Naval Research Logistics, 2009, 56, 1-18.  doi:10.1002/nav.20323

  15. C.N. Potts and V.A. Strusevich. Fifty years of scheduling: a survey of milestones, Journal of the Operational Research Society, 2009, 60, S41-S68, doi: 10.1057/jors.2009.2

  16. H. Kellerer, M.A. Kubzin and V.A. Strusevich. Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research, 2009, 199, 111-116. doi: 10.1016/j.ejor.2008.11.003

  17. N.V. Shakhlevich, A. Shioura and V.A. Strusevich. Single machine scheduling with controllable processing times by submodular optimization. International Journal of Foundations of Computer Science, 2009, 20, 247-269. doi: 10.1142/S0129054109006541

  18. N.V. Shakhlevich and V.A. Strusevich. Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 2008, 51: 451–473. doi:10.1007/s00453-007-9091-9

  19. J.-C. Billaut, I.V. Gribkovskaia and V.A. Strusevich. An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times. IIE Transactions, 2008, 40, 478-493, doi:10.1080/07408170701592473

  20. H. Kellerer and V.A. Strusevich. Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics. 2008, 55: 377-389, doi:10.1002/nav.20292

  21. V.S. Gordon, C.N. Potts, V.A. Strusevich and J.D. Whitehead. Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation.  Journal of Scheduling, 2008, 11, 357-370,  doi:10.1007/s10951-008-0064-x

  22. N.V. Shakhlevich, A. Shioura and V.A. Strusevich. Fast divide-and -conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroidal approach. Lecture Notes in Computer Science, 2008, 5193, 756-767.

  23. V.S. Gordon and V.A. Strusevich. Schedules with due-date assignment and position-dependent processing times. Doklady of the National Academy of Sciences of Belarus, 2008, 52, No 5, 24-30 (in Russian)

  24. V.S. Gordon, M.Y. Kovalyov, G.M. Levin, Y.M. Shafransky, Y.N. Sotskov,  V.A. Strusevich and A.V. Tuzikov. Vyscheslav Tanaev: contributions to scheduling and related areas. Accepted by Journal of Scheduling. doi:10.1007/s10951-011-0230-

  25. V. Gordon, V. Strusevich, A. Dolgui, Scheduling with due date assignment under special conditions on job processing. Accepted by Journal of Scheduling. doi:10.1007/s10951-011-0240-

  26. H. Kellerer and V.A. Strusevich. The symmetric quadratic knapsack problem: Approximation and scheduling applications. Accepted by 4OR. doi:10.1007/s10288-011-0180-x

  27. K. Rustogi and V.A. Strusevich. Single machine scheduling with general positional deterioration and rate-modifying maintenance. Accepted by Omega, The International Journal of Management Science. doi:10.1016/j.omega.2011.12.007

  28. H. Kellerer, A.J. Soper and V.A. Strusevich. Preemptive scheduling on two identical parallel machines with a single transporter. Report SORG-01-2011.

  29. H. Kellerer, K. Rustogi and V.A. Strusevich. Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Report SORG-02-2011.

  30. A. Shioura, N.V. Shakhlevich and V.A. Strusevich. A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. Report SORG-04-2011

  31. K. Rustogi, V.A. Strusevich. Simple matching vs linear assignment in scheduling models with positional effects: A critical review. Report SORG-06-2011

  32. F. Qian, V.A. Strusevich, I. Gribkovskaia, Ø. Halskau. Minimization of passenger takeoff and landing risk in offshore helicopter transportation: Models, approaches and analysis. Report SORG-07-2011

  33. A.J. Soper, V.A. Strusevich. Single parameter analysis of power of preemption on two and three uniform machines. Report SORG-01-2012

  34. K. Rustogi, V.A. Strusevich. Parallel machine scheduling: Impact of adding an extra machine. Report SORG-02-2012

Papers (2001 - 2007)

  1. A.J. Soper, V.A. Strusevich. An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter.  International Journal of Foundations of Computer Science, 2007, 18, 565-591. doi:10.1142/S012905410700484X

  2.  Y.L. Orlovich, V.S. Gordon, C.N. Potts, V.A. Strusevich. On Hamilton cycles in locally connected graphs with vertex degree constraints. Electronic Notes in Discrete Mathematics, 2007, 29, 169-173.  doi:10.1016/j.endm.2007.07.028

  3. N.V. Shakhlevich,  V.A. Strusevich. Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 2006, 154, 2178-2199. doi:10.1016/j.dam.2005.04.014

  4. H. Kellerer, V.A. Strusevich. A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.  Theoretical Computer Science, 2006, 369, 230-238, doi:10.1016/j.tcs.2006.08.030 

  5. M.A. Kubzin, V.A. Strusevich. Planning machine maintenance in two-machine shop scheduling. Operations Research, 2006, 54, 789-800. doi:10.1287/opre.1060.0301

  6. I.V. Gribkovskaia, C.-Y. Lee, V.A. Strusevich, D. de Werra. Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters, 2006, 34, 459-464. doi:10.1016/j.orl.2005.07.006

  7. M.A. Kubzin, V.A. Strusevich, J. Breit, G. Schmidt. Polynomial-time approximation schemes for the open shop scheduling problem with non-availability constraints. Naval Research Logistics, 2006, 53, 16-23. doi:10.1002/nav.20122

  8. M.A. Kubzin, V.A. Strusevich. Two-machine flow shop no-wait scheduling with machine maintenance. 4OR, 2005, 3, 303-313. doi:10.1007/s10288-005-0070-1

  9. C. Esswein, J.-C. Billaut, V.A. Strusevich. Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research, 2005, 167, 796-809.

  10. J.-L. Bouquard, J.-C. Billaut, M.A. Kubzin, V.A. Strusevich. Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 2005, 33, 255-262. doi:10.1016/j.orl.2004.06.003

  11. V.S. Gordon, J.-M. Proth, V.A. Strusevich. Single machine scheduling and due date assignment under series-parallel precedence constraints. Central European Journal of Operations Research, 2005, 13, 15-35.

  12. N.V. Shakhlevich,  V.A. Strusevich. Pre-emptive scheduling problems with controllable processing times. Journal of Scheduling, 2005, 8, 233-253, doi:10.1007/s10951-005-6813-1

  13. C.-Y. Lee,  V.A. Strusevich. Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Transactions, 2005, 37, 725-736. doi:10.1080/07408170590918290

  14. M.A. Kubzin, V.A. Strusevich. Two-machine flow shop no-wait scheduling with a non-availability interval. Naval Research Logistics, 2004, 51, 613-631. doi:10.1002/nav.10118

  15. M.Y. Kovalyov, C.N. Potts, V.A. Strusevich. Batching decisions for assembly production systems. European Journal of Operational Research, 2004, 157, 620-642. doi:10.1016/S0377-2217(03)00250-9

  16. J.N.D. Gupta, C.P. Koulamas, G.J. Kyparisis, C.N. Potts, V.A. Strusevich. Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Annals of Operations Research, 2004, 129, 171-185. doi:0.1023/B:ANOR.0000030687.169.c7

  17. A.A. Gladky, Y.M. Shafransky, V.A. Strusevich. Flow shop scheduling problems under machine-dependent precedence constraints, Journal on Combinatorial Optimization, 2004, 8, 13-28. doi: 10.1023/B:JOCO.0000021935.66577.09

  18. V.S. Gordon, J.-M. Proth, V.A. Strusevich. Scheduling with due date assignment, In: Handbook of Scheduling: Algorithms, Models and Performance Analysis. J. Leung (Ed.), Chapman & Hall/CRC, London, 2004, pp. 21-1 – 21-22.

  19. H. Kelleler, V.A. Strusevich. Scheduling problems for parallel dedicated machines under multiple resource constraints, Discrete Applied Mathematics, 2004, 113, 45-68, doi:10.1016/S0166-218X(03)00433-5 

  20. J. Breit, G. Schmidt, V.A. Strusevich. Non-preemptive two-machine open shop scheduling with non-availability constraints, Mathematical Methods of Operations Research, 2003, 57, 217-234. doi: 10.1007/s001860200267

  21. H. Kelleler, V.A. Strusevich. Scheduling parallel dedicated machines under a single non-shared resource, European Journal of Operational Research, 2003, 147, 345-364, doi:10.1016/S0377-2217(02)00246-1

  22. V.A. Strusevich, I.G. Drobouchevitch, N.V. Shakhlevich. Three-machine shop scheduling with partially ordered processing routes. Journal of Operational Research Society, 2002, 53, 574-582. doi:10.1057/palgrave/jors/2601329

  23. I.G. Drobouchevitch, V.A. Strusevich. Two-stage open shop scheduling problem with a bottleneck machine. European Journal of Operational Research, 2001, 128, p. 159-174.

  24. C.N. Potts, V.A. Strusevich, T. Tautenhahn. Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 2001, 4, p.25-51.

  25. C.A. Glass, C.N. Potts, V.A. Strusevich. Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 2001, 13, 120-137.   doi:10.1287/ijoc.13.2.120.10521

  26. J. Breit, G. Schmidt, V. A. Strusevich. Two-machine open shop scheduling with an availability constraint. Operations Research Letters, 2001, 29, 65-77. 
     

Papers (1996-2000)

  1. I.G. Drobouchevitch, V.A. Strusevich. Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. European Journal of Operational Research, 2000, 123, 229-240. 
  2. C.A. Glass, Y.M. Shafransky, V.A. Strusevich. Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 2000, 47, 304-328.
  3. V.A. Strusevich. Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 2000, 26, 181-192.  
  4. V.S. Gordon, V.A. Strusevich. Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 1999, 26, 157-177.
  5. I.G. Drobouchevitch, V.A. Strusevich. A heuristic algorithm for the two-machine re-entrant shop scheduling. Annals of Operations Research, 1999, 86,  417-439.
  6. V.A. Strusevich, A.J.A. van de Waart, R. Dekker. A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 1999, 5, 5-28.
  7. D. Rebaine, V.A. Strusevich. Two-machine open shop scheduling problems with special transportation times. Journal of Operational Research Society, 1999, 50, 756-764.
  8. V.A. Strusevich. A heuristic for the two-machine open shop scheduling problem with transportation times. Discrete Applied Mathematics, 1999, 93, 287-304.
  9. I.G. Drobouchevitch, V.A. Strusevich. A polynomial algorithm for the three-machine open shop with a bottleneck machine. Annals of Operations Research, 1999, 92, 185-210. 
  10. V.A. Strusevich. A greedy open shop heuristic with job priorities. Annals of Operations Research, 1998, 83,  253-270.
  11. B. Chen, C.N. Potts, V.A. Strusevich. Approximation algorithms for two machine flow shop with batch setup times. Mathematical Programming, 1998, 82, 255-271.
  12. Y.M. Shafransky, V.A. Strusevich. The open shop scheduling problem with a given sequence on one machine. Naval Research Logistics, 1998, 45, 705-731.
  13. I.G. Drobouchevitch, V.A. Strusevich. Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 1998, 48,      359-375.
  14. V.A. Strusevich. Multi-stage scheduling problems with precedence constraints. In: Applications of Combinatorial Mathematics, C.Mitchell (Ed.), Oxfrod, University Press, 1997, pp. 217-232.
  15. V.A. Strusevich. Shop scheduling problems under precedence constraints. Annals of Operations Research, 1997, 69, 351-377.
  16. J.N.D. Gupta, V.A. Strusevich, C.M. Zwaneveld. Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 1997, 24, 1025-1031.
  17. V.A. Strusevich, L.A. Hall. An open shop scheduling problem with a non-bottleneck machine. Operations Research Letters, 1997, 21, 11-18.
  18. B. Chen, C. A. Glass, C. N. Potts, V. A. Strusevich. A new heuristic for three machine flow shop scheduling, Operations Research, 1996, 44,  891-898.

Papers (1990-1995)

  1. C. N. Potts, S. V. Sevast'janov, V.A. Strusevich, L. N. Van Wassenhove, C. M. Zwaneveld. The two-stage assembly scheduling problem: complexity and approximation, Operations Research, 1995, 43, 346-355.
  2. V.A. Strusevich. Two machine flow shop scheduling problem with no-wait in process: controllable machine speeds, Discrete Applied Mathematics, 1995, 59,    75-86.
  3. V.A. Strusevich. C. M. Zwaneveld. On non-permutation solutions to some two-machine flow shop scheduling problems, Zeitschrift fur Operations Research, 1994, 39, 305-319.
  4. N.V. Shakhlevich, V.A. Strusevich. Two machine open shop scheduling problem to minimize an arbitrary machine usage penalty function, European Journal of Operational Research, 1993, 70, 391-404.
  5. V.A. Strusevich. Two machine open shop scheduling problem with setup, processing and removal times separated, Computers & Operations Research, 1993, 20, 597-611.
  6. B. Chen, V.A. Strusevich. Approximation algorithms for three machine open shop scheduling, ORSA Journal on Computing, 1993, 5, 321-328.
  7. B. Chen, V.A. Strusevich. Worst-case analysis of heuristics for open shops with parallel machines, European Journal of Operational Research, 1993, 70, 379-390.
  8. V.A. Strusevich, N. V. Shakhlevich. Optimal scheduling two jobs in open shops. Zhurnal Vychislitelnoj Matematiki i Matematicheskoj Fiziki, 1993, 33, 679-670 (in Russian) {translated into English as Optimal job-shop scheduling with two jobs in systems with unrestricted paths. Computational Mathematics and Mathematical Physics, 1993, 33, 593-601}.
  9. V.A. Strusevich. Two machine super shop scheduling problem, Journal of the Operational Research Society, 1991, 42, 479-492.