Items where Author is "Strusevich, Vitaly A."

Article

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)

Kellerer, Hans and Strusevich, Vitaly A. (2012) 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)

Blazewicz, Jacek, Burke, Edumnd K., Gordon, Valery S., Kovalyov, Mikhail Y., Shafransky, Yakov M. and Strusevich, Vitaly A. (2012) 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)

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

Kellerer, Hans, Soper, Alan J. and Strusevich, Vitaly A. (2012) Preemptive scheduling on two identical parallel machines with a single transporter. Journal of Combinatorial Optimization. ISSN 1382-6905 (In Press) (doi:10.1007/s10878-012-9511-x)

Gordon, Valery S., Orlovich, Yury L., Potts, Chris N. and Strusevich, Vitaly A. (2011) 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)

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

Kellerer, Hans, Soper, Alan J. and Strusevich, Vitaly A. (2010) Transporting jobs through a processing center with two parallel machines. Lecture Notes in Computer Science, 6508. pp. 408-422. ISSN 0302-9743 (doi:10.1007/978-3-642-17458-2_33)

Kellerer, Hans and Strusevich, Vitaly A. (2010) 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. (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, 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)

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. and Strusevich, Vitaly A. (2009) Transporting jobs through a two-machine open shop. Naval Research Logistics, 56 (1). pp. 1-18. ISSN 0894-069X (doi:10.1002/nav.20323)

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)

Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) 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)

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)

Billaut, Jean-Charles, Gribkovskaia, Irina and Strusevich, Vitaly A. (2008) An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times. IIE Transactions, 40 (4). pp. 478-493. ISSN 1545-8830 (electronic) 0740-817X (paper) (doi:10.1080/07408170701592473)

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 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 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)

Kellerer, Hans and Strusevich, Vitaly A. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369 (1-3). pp. 230-238. ISSN 0304-3975 (doi:10.1016/j.tcs.2006.08.030 |)

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)

Kubzin, Mikhail A. and Strusevich, Vitaly A. (2006) Planning machine maintenance in two-machine shop scheduling. Operations Research, 54 (4 ). pp. 789-800. ISSN 0030-364X (Print) 1526-5463 (Online) (doi:10.1287/opre.1060.0301)

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)

Kelleler, Hans and Strusevich, Vitaly A. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:10.1016/j.tcs.2006.08.030)

Book Section

Soper, Alan and Strusevich, Vitaly A. (2006) Two-machine flow shop scheduling with an interstage transporter: two shipments. In: 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

Conference Proceedings

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)