Items where Greenwich Author is "Strusevich, Vitaly"

Group by: Item Type | Date | Funders | Uncontrolled Keywords | No Grouping

Jump to: BRFFR | CNRS | EPSRC | EPSRC (project EP/I018441/1 “Quadratic and Linear Knapsack Problems with Scheduling Applications") | EPSRC (project EP/I018441/1 “Quadratic and Linear Knapsack Problems with Scheduling Applications”) | Engineering and Physical Sciences Research Council (EPSRC) | Engineering and Physical Sciences Research Council (EPSRC) (Grant No. EP/I018441/1) | Engineering and Physical Sciences Research Council (Grant No. EP/I018441/1) | Engineering and Physical Sciences Research Council (Grant No. EP/J019755/1) | Humboldt Research Fellowship | INTAS | INTAS (Grant Number: Project 03-51-5501) | INTAS Project 03-51-5501 (V.A.S.) | INTAS Project 93-257 (V.A.S.) | INTAS network 03-51-5501 | ISTC | International Association for the Promotion of Co-operation with Scientists from the Independent states of the Former Soviet Union, INTAS 93-257-Ext | International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS 93-257 | International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS-93-257 | International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS-93-257-Ext. | International Association for the Promotion of the Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS 93-257 | International Science and Technology Center, Project B-104-98 (Yakov M. Shafransky) | JSPS/MEXT KAKENHI | Japan Society for the Promotion of Science KAKENHI (Grant No. 15K00030; 15H00848) | NSF Research Initiation Award DMI-9496153 (L.A.H.) | Project INTAS 93-257 | Research of J. Breit and G. Schmidt was partially supported by INTAS Grant No. 96-0820 | The Engineering and Physical Sciences Research Council (EPSRC) | The Royal Society | The Royal Society (Yakov M. Shafransky) | University of Greenwich (Yakov M. Shafransky)

Number of items: 37.

BRFFR

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:https://doi.org/10.1016/j.dam.2010.10.005)

CNRS

EPSRC

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2016) Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines. INFORMS Journal on Computing, 28 (1). pp. 148-161. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.2015.0660)

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:https://doi.org/10.1007/s10107-014-0814-9)

EPSRC (project EP/I018441/1 “Quadratic and Linear Knapsack Problems with Scheduling Applications")

Kellerer, Hans, Soper, Alan J. ORCID: 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:https://doi.org/10.1007/s10878-012-9511-x)

EPSRC (project EP/I018441/1 “Quadratic and Linear Knapsack Problems with Scheduling Applications”)

Kellerer, Hans and Strusevich, Vitaly (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research, 228 (1). pp. 24-32. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2012.12.028)

Engineering and Physical Sciences Research Council (EPSRC)

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:https://doi.org/10.1007/s10288-011-0180-x)

Engineering and Physical Sciences Research Council (EPSRC) (Grant No. EP/I018441/1)

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

Engineering and Physical Sciences Research Council (Grant No. EP/I018441/1)

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:https://doi.org/10.1007/s10951-012-0287-8)

Engineering and Physical Sciences Research Council (Grant No. EP/J019755/1)

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:https://doi.org/10.1007/s10898-018-0686-2)

Humboldt Research Fellowship

INTAS

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:https://doi.org/10.1016/j.ejor.2009.01.029)

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:https://doi.org/10.1016/j.ejor.2008.07.044)

Gordon, V.S., Potts, C.N., Strusevich, V.A. and Whitehead, J.D. (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11 (5). pp. 357-370. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-008-0064-x)

Soper, Alan ORCID: 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:https://doi.org/10.1142/S012905410700484X)

INTAS (Grant Number: Project 03-51-5501)

Lushchakova, Irina N., Soper, Alan J. ORCID: 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:https://doi.org/10.1002/nav.20323)

INTAS Project 03-51-5501 (V.A.S.)

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:https://doi.org/10.1007/s10951-005-6813-1)

INTAS Project 93-257 (V.A.S.)

Strusevich, V.A. and Hall, L.A. (1997) An open shop scheduling problem with a non-bottleneck machine. Operations Research Letters, 21 (1). pp. 11-18. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(97)00030-8)

INTAS network 03-51-5501

Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C. and Strusevich, V. (2009) Operator non-availability periods. 4OR: A Quarterly Journal of Operations Research, 7 (3). pp. 239-253. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:https://doi.org/10.1007/s10288-008-0084-6)

ISTC

International Association for the Promotion of Co-operation with Scientists from the Independent states of the Former Soviet Union, INTAS 93-257-Ext

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:https://doi.org/10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1)

International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS 93-257

Drobouchevitch, I. G. and Strusevich, V. A. (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research, 86. pp. 417-439. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018927407164)

International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS-93-257

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:https://doi.org/10.1023/A:1018982630730)

International Association for the Promotion of Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS-93-257-Ext.

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:https://doi.org/10.1016/S0377-2217(99)00356-2)

Drobouchevitch, I.G. and Strusevich, V.A. (2000) Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. European Journal of Operational Research, 123 (2). pp. 229-240. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(99)00253-2)

International Association for the Promotion of the Cooperation with Scientists from the Independent States of the Former Soviet Union, INTAS 93-257

Strusevich, V.A. (1998) A greedy open shop heuristic with job priorities. Annals of Operations Research, 83. pp. 253-270. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018964131329)

International Science and Technology Center, Project B-104-98 (Yakov M. Shafransky)

JSPS/MEXT KAKENHI

Japan Society for the Promotion of Science KAKENHI (Grant No. 15K00030; 15H00848)

NSF Research Initiation Award DMI-9496153 (L.A.H.)

Project INTAS 93-257

Strusevich, V.A. (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Applied Mathematics, 93 (2-3). pp. 287-304. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(99)00115-8)

Research of J. Breit and G. Schmidt was partially supported by INTAS Grant No. 96-0820

Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)

The Engineering and Physical Sciences Research Council (EPSRC)

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:https://doi.org/10.1287/ijoc.2017.0758)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2017) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266 (3). pp. 795-818. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2017.08.034)

The Royal Society

Gladky, A.A., Shafransky, Y.M. and Strusevich, V.A. (2004) Flow shop scheduling problems under machine–dependent precedence constraints. Journal of Combinatorial Optimization, 8 (1). pp. 13-28. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:https://doi.org/10.1023/B:JOCO.0000021935.66577.09)

The Royal Society (Yakov M. Shafransky)

University of Greenwich (Yakov M. Shafransky)

This list was generated on Thu Nov 21 16:08:45 2024 UTC.

Export as	RSS