Strusevich, Vitaly A. (2020) Approximation algorithms for makespan minimization on identical parallel machines under resource constraints. Journal of the Operational Research Society, 72 (9). pp. 2135-2146. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:10.1080/01605682.2020.1772019)

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2018) A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date. Omega, 90:101992. ISSN 0305-0483 (doi:10.1016/j.omega.2018.11.001)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2018) Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. Journal of Global Optimization, 76 (3). pp. 471-490. ISSN 0925-5001 (Print), 1573-2916 (Online) (doi:10.1007/s10898-018-0686-2)

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2018) Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Annals of Operations Research, 298 (1-2). pp. 469-495. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1007/s10479-018-2952-6)

Halman, Nir, Kellerer, Hans and Strusevich, Vitaly A. (2018) Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints. European Journal of Operational Research, 270 (2). pp. 435-447. ISSN 0377-2217 (doi:10.1016/j.ejor.2018.04.013)

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2018) Schedules with a single preemption on uniform parallel machines. Discrete Applied Mathematics. ISSN 0166-218X (doi:10.1016/j.dam.2018.03.007)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2017) Machine speed scaling by adapting methods for convex optimization with submodular constraints. INFORMS Journal on Computing, 29 (4). pp. 724-736. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:10.1287/ijoc.2017.0758)

Rustogi, Kabir and Strusevich, Vitaly A. (2016) Single machine scheduling with a generalized job-dependent cumulative effect. Journal of Scheduling, 20 (6). pp. 583-592. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-016-0497-6)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2015) Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Mathematical Programming, 153 (2). pp. 495-534. ISSN 0025-5610 (Print), 1436-4646 (Online) (doi:10.1007/s10107-014-0814-9)

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2014) Power of preemption on uniform parallel machines. In: 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’14) / 18th International Workshop on Randomization and Computation (RANDOM’14). Leibniz International Proceedings in Informatics (LIPIcs) (28). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 392-402. ISBN 9783939897743 ISSN 1868-8969 (doi:10.4230/LIPIcs.APPROX-RANDOM.2014.392)

Quibell, Richard and Strusevich, Vitaly A. (2014) An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order. Computers & Industrial Engineering, 76. pp. 347-359. ISSN 0360-8352 (doi:10.1016/j.cie.2014.08.009)

Rustogi, Kabir and Strusevich, Vitaly A. (2014) Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. Journal of the Operational Research Society, 66 (3). pp. 500-515. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:10.1057/jors.2014.18)

Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2014) Single parameter analysis of power of preemption on two and three uniform machines. Discrete Optimization, 12. pp. 26-46. ISSN 1572-5286 (doi:10.1016/j.disopt.2013.12.004)

Rustogi, Kabir and Strusevich, Vitaly A. (2014) Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega, 42 (1). pp. 166-178. ISSN 0305-0483 (doi:10.1016/j.omega.2013.05.005)

Strusevich, Vitaly A. and Kellerer, Hans (2013) Approximation schemes for quadratic Boolean programming problems and their scheduling applications. In: OR55 Annual Conference - Keynote Papers and Extended Abstracts. Operational Research Society Limited, Birmingham, UK, pp. 73-85. ISBN 0903440555

Rustogi, Kabir and Strusevich, Vitaly A. (2013) Parallel machine scheduling: Impact of adding extra machines. Operations Research, 61 (5). pp. 1243-1257. ISSN 0030-364X (Print), 1526-5463 (Online) (doi:10.1287/opre.2013.1208)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2013) A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. SIAM Journal on Discrete Mathematics, 27 (1). pp. 186-204. ISSN 0895-4801 (Print), 1095-7146 (Online) (doi:10.1137/110843836)

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2012) Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16 (6). pp. 675-683. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-012-0287-8)

Kellerer, Hans, Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2012) Preemptive scheduling on two identical parallel machines with a single transporter. Journal of Combinatorial Optimization, 25 (2). pp. 279-307. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:10.1007/s10878-012-9511-x)

Rustogi, Kabir and Strusevich, Vitaly A. (2012) Simple matching vs linear assignment in scheduling models with positional effects: A critical review. European Journal of Operational Research, 222 (3). pp. 393-407. ISSN 0377-2217 (doi:10.1016/j.ejor.2012.04.037)

Rustogi, Kabir and Strusevich, Vitaly A. (2012) Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40 (6). pp. 791-804. ISSN 0305-0483 (doi:10.1016/j.omega.2011.12.007)

Blazewicz, Jacek, Burke, Edumnd K., Gordon, Valery S., Kovalyov, Mikhail Y., Shafransky, Yakov M. and Strusevich, Vitaly A. (2011) Editorial: new branches, old roots. Journal of Scheduling, 15 (4). pp. 399-401. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-011-0262-9)

Kellerer, Hans and Strusevich, Vitaly A. (2011) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR: A Quarterly Journal of Operations Research, 10 (2). pp. 111-161. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:10.1007/s10288-011-0180-x)

Rustogi, Kabir and Strusevich, Vitaly A. (2011) Convex and V-shaped sequences of sums of functions that depend on ceiling functions. Journal of Integer Sequences, 14 (1). pp. 1-9. ISSN 1530-7638

Gordon, Valery S., Orlovich, Yury L., Potts, Chris N. and Strusevich, Vitaly A. (2010) Hamiltonian properties of locally connected graphs with bounded vertex degree. Discrete Applied Mathematics, 159 (16). pp. 1759-1774. ISSN 0166-218X (doi:10.1016/j.dam.2010.10.005)

Kellerer, Hans and Strusevich, Vitaly A. (2010) 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 (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:10.1142/S0129054110007301)

Lushchakova, Irina N. and Strusevich, Vitaly A. (2010) Scheduling incompatible tasks on two machines. European Journal of Operational Research, 200 (2). pp. 334-346. (doi:10.1016/j.ejor.2009.01.029)

Kellerer, Hans, Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2010) Transporting jobs through a processing center with two parallel machines. In: Wu, Weili and Daescu, Ovidiu, (eds.) Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Lecture Notes in Computer Science (6508). Springer Berlin Heidelberg, Berlin, Germany, pp. 408-422. ISBN 978364274575 ISSN 0302-9743 (doi:10.1007/978-3-642-17458-2_33)

Kellerer, Hans, Kubzin, Mikhail A. and Strusevich, Vitaly A. (2009) 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, 199 (1). pp. 111-116. ISSN 0377-2217 (doi:10.1016/j.ejor.2008.11.003)

Gordon, Valery S. and Strusevich, Vitaly A. (2009) Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198 (1). pp. 57-62. ISSN 0377-2217 (doi:10.1016/j.ejor.2008.07.044)

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2009) Single machine scheduling with controllable processing times by submodular optimization. International Journal of Foundations of Computer Science, 20 (2). pp. 247-269. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:10.1142/S0129054109006541)

Kubzin, Mikhail A., Potts, Chris N. and Strusevich, Vitaly A. (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Computers & Operations Research, 36 (2). pp. 379-390. ISSN 0305-0548 (doi:10.1016/j.cor.2007.10.013)

Lushchakova, Irina N., Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2008) Transporting jobs through a two-machine open shop. Naval Research Logistics (NRL), 56 (1). pp. 1-18. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/nav.20323)

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2008) Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroid optimization approach. In: Algorithms – ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science (5193). Springer Verlag, Berlin/Heidelberg, Germany, pp. 756-767. ISBN 978-3-540-87743-1 (doi:10.1007/978-3-540-87744-8_63)

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

Kellerer, Hans and Strusevich, Vitaly A. (2008) Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics (NRL), 55 (5). pp. 377-389. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/nav.20292)

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2007) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)

Orlovich, Yury L., Gordon, Valery S., Potts, Chris N. and Strusevich, Vitaly A. (2007) On Hamilton cycles in locally connected graphs with vertex degree constraints. Electronic Notes in Discrete Mathematics, 29. pp. 169-173. ISSN 1571-0653 (doi:10.1016/j.endm.2007.07.028)

Soper, Alan ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2007) An approximation algorithm for the two-machine flow shop with a single transporter. International Journal of Foundations of Computer Science (ijfcs), 18 (3). pp. 565-591. ISSN 0129-0541 (doi:10.1142/S012905410700484X)

Soper, Alan ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2007) An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter. International Journal of Foundations of Computer Science, 18 (3). pp. 565-591. ISSN 0129-0541 (doi:10.1142/S012905410700484X)

Soper, Alan ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2006) Two-machine flow shop scheduling with an interstage transporter: two shipments. In: Dolgui, Alexandre, Morel, Gerard and Pereira, Carlos Eduardo, (eds.) Information Control Problems in Manufacturing 2006: A Proceedings volume from the 12th IFAC International Symposium, St Etienne, France, 17-19 May 2006. IFAC Proceedings Volumes, 3 . Elsevier Ltd., Oxford, UK, pp. 27-32. ISBN 978-0-08-044654-7

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)

Lee, Chung-Yee, Gribkovskaia, Irina, Strusevich, Vitaly A. and de Werra, Dominique (2006) Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters, 34 (4). pp. 459-464. ISSN 0167-6377 (doi:10.1016/j.orl.2005.07.006)

Potts, Chris N., Strusevich, Vitaly A. and Whitehead, Jonathan D. (2006) On-line algorithms for single machine scheduling with family setup times. In: 12th IFAC Symposium on Information Control Problems in Manufacturing, 2006 [Proceedings]. Information Control Problems in Manufacturing (12:1). International Federation of Automatic Control, Laxenburg, Austria, pp. 135-141. ISBN 9783902661043 (doi:10.3182/20060517-3-FR-2903.00084)

Kubzin, Mikhail A., Strusevich, Vitaly A., Breit, J. and Schmidt, G. (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Research Logistics, 53 (1). pp. 16-23. ISSN 0894-069X (doi:10.1002/nav.20122)

Esswein, Carl, Billaut, Jean-Charles and Strusevich, Vitaly A. (2005) Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research, 167 (3). pp. 796-809. ISSN 0377-2217 (Print), 0377-2217 (Online) (doi:10.1016/j.ejor.2004.01.029)

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2005) Pre-emptive scheduling problems with controllable processing times. Journal of Scheduling, 8 (3). pp. 233-253. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-005-6813-1)

Lee, Chung-Yee and Strusevich, Vitaly A. (2005) Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter. IIE Transactions, 37 (8). pp. 725-736. ISSN 0740-817X (Print), 1545-8830 (Online) (doi:10.1080/07408170590918290)

Gupta, Jatinder N.D., Koulamas, Christos P., Kyparisis, George J., Potts, Chris N. and Strusevich, Vitaly A. (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Annals of Operations Research, 129 (1-4). pp. 171-185. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/B:ANOR.0000030687.72169.c7)

Gordon, Valery S., Proth, Jean-Marie and Strusevich, Vitaly A. (2004) Scheduling with due-date assignment. In: Leung, Joseph Y.-T., (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC Computer Information Science . CRC Press LLC, Florida, USA, p. 21. ISBN 9781584883975

Kubzin, Mikhail A. and Strusevich, Vitaly A. (2004) Two-machine flowshop scheduling problems with no-wait jobs. Naval Research Logistics, 51 (4). pp. 613-631. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/nav.10118)

Eglese, Richard W., Everett, Martin G., Potts, Chris N. and Strusevich, Vitaly A. (2003) Preface [Special Issue: International Symposium on Combinatorial Optimisation (CO2000)]. Discrete Applied Mathematics, 133 (1-3). pp. 1-2. ISSN 0166-218X (doi:10.1016/S0166-218X(03)00430-X)

Breit, Joachim, Schmidt, Günter and Strusevich, Vitaly A. (2001) Two-machine open shop scheduling with an availability constraint. Operations Research Letters, 29 (2). pp. 65-77. ISSN 0167-6377 (doi:10.1016/S0167-6377(01)00079-7)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (2001) Two-stage open shop scheduling with a bottleneck machine. European Journal of Operational Research, 128 (1). pp. 159-174. ISSN 0377-2217 (doi:10.1016/S0377-2217(99)00356-2)

Glass, Celia A., Shafransky, Yakov M. and Strusevich, Vitaly A. (2000) Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47 (4). pp. 304-328. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1999) A polynomial algorithm for the three-machine open shop with a bottleneck machine. Annals of Operations Research, 92. pp. 185-210. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:10.1023/A:1018982630730)

Chen, Bo, Potts, Chris N. and Strusevich, Vitaly A. (1998) Approximation algorithms for two-machine flow shop scheduling with batch setup times. Mathematical Programming, 82 (1-2). pp. 255-271. ISSN 0025-5610 (Print), 1436-4646 (Online) (doi:10.1007/BF01585875)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1998) Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 48 (3). pp. 359-375. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:10.1007/s001860050033)

Chen, Bo, Glass, Celia A., Potts, Chris N. and Strusevich, Vitaly A. (1996) A new heuristic for three-machine flow shop scheduling. Operations Research, 44 (6). pp. 891-898. ISSN 0030-364X (Print), 1526-5463 (Online) (doi:10.1287/opre.44.6.891)