Items where Author is "Strusevich, V.A."
 | Up a level |
analysis of algorithms
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
approximation
Bouquard, J-L, Billaut, J.-C., Kubzin, M.A. and Strusevich, V.A. (2005) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33 (3). pp. 255-262. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2004.06.003)
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)
Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)
Strusevich, V.A. (2000) Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26 (4). pp. 181-192. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(00)00021-3)
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)
Strusevich, V.A., van de Waart, A.J.A. and Dekker, R. (1999) A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 5 (1). pp. 5-28. ISSN 1381-1231 (Print), 1572-9397 (Online) (doi:https://doi.org/10.1023/A:1009643112214)
Shafransky, Y.M. and Strusevich, V.A. (1998) The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics (NRL), 45 (7). pp. 705-731. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F)
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)
approximation algorithm
Strusevich, V.A., Drobouchevitch, I.G. and Shakhlevich, N.V. (2002) Three-machine shop scheduling with partially ordered processing routes. Journal of the Operational Research Society, 53 (5). pp. 574-582. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/palgrave.jors.2601329)
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)
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)
assembly scheduling problem
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
availability constraints
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)
batch availability
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
batching
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
Strusevich, V.A. (2000) Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26 (4). pp. 181-192. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(00)00021-3)
complexity
Bouquard, J-L, Billaut, J.-C., Kubzin, M.A. and Strusevich, V.A. (2005) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33 (3). pp. 255-262. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2004.06.003)
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)
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)
Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)
Shafransky, Y.M. and Strusevich, V.A. (1998) The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics (NRL), 45 (7). pp. 705-731. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F)
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)
computational complexity
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
Strusevich, V.A. (1997) Shop scheduling problems under precedence constraints. Annals of Operations Research, 69. pp. 351-377. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018997431986)
deteriorating jobs
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)
due date assignment
Gordon, V.S. and Strusevich, V.A. (1998) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26 (2). pp. 157-177. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(98)00055-0)
dynamic programming
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)
earliness penalties
Gordon, V.S. and Strusevich, V.A. (1998) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26 (2). pp. 157-177. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(98)00055-0)
flow shop
Bouquard, J-L, Billaut, J.-C., Kubzin, M.A. and Strusevich, V.A. (2005) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33 (3). pp. 255-262. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2004.06.003)
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)
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157 (3). pp. 620-642. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(03)00250-9)
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
flow-shop
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
fully polynomial approximation scheme
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)
group technology
Strusevich, V.A. (2000) Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26 (4). pp. 181-192. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(00)00021-3)
heuristics
Strusevich, V.A., van de Waart, A.J.A. and Dekker, R. (1999) A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 5 (1). pp. 5-28. ISSN 1381-1231 (Print), 1572-9397 (Online) (doi:https://doi.org/10.1023/A:1009643112214)
history
Potts, C.N. and Strusevich, V.A. (2009) Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society, 60 (S1). S41-S68. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/jors.2009.2)
job shop
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
job shop scheduling
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)
learning effect
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)
maintenance
Kubzin, M.A. and Strusevich, V.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:https://doi.org/10.1287/opre.1060.0301)
milestones
Potts, C.N. and Strusevich, V.A. (2009) Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society, 60 (S1). S41-S68. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/jors.2009.2)
Minsk Group
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
mixed graph
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
multiple machine
Kubzin, M.A. and Strusevich, V.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:https://doi.org/10.1287/opre.1060.0301)
no-wait
Bouquard, J-L, Billaut, J.-C., Kubzin, M.A. and Strusevich, V.A. (2005) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33 (3). pp. 255-262. ISSN 0167-6377 (doi:https://doi.org/10.1016/j.orl.2004.06.003)
non-shared resources
Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)
NP-hard
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
open shop
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
Strusevich, V.A. (2000) Group technology approach to the open shop scheduling problem with batch setup times. Operations Research Letters, 26 (4). pp. 181-192. ISSN 0167-6377 (doi:https://doi.org/10.1016/S0167-6377(00)00021-3)
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)
Shafransky, Y.M. and Strusevich, V.A. (1998) The open shop scheduling problem with a given sequence of jobs on one machine. Naval Research Logistics (NRL), 45 (7). pp. 705-731. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F)
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)
open shop scheduling
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)
Rebaine, D. and Strusevich, V.A. (1999) Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society, 50. pp. 756-764. ISSN 0160-5682 (doi:https://doi.org/10.1057/palgrave.jors.2600769)
Strusevich, V.A., van de Waart, A.J.A. and Dekker, R. (1999) A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 5 (1). pp. 5-28. ISSN 1381-1231 (Print), 1572-9397 (Online) (doi:https://doi.org/10.1023/A:1009643112214)
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)
open-shop
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
optimization problems
Gordon, V.S., Kovalyov, M. Ya, Levin, G.M., Sotskov, Yu N., Strusevich, V.A., Tuzikov, A.V. and Shafransky, Ya M. (2010) Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary. Automation and Remote Control, 71 (10). pp. 2021-2028. ISSN 0005-1179 (Print), 1608-3032 (Online) (doi:https://doi.org/10.1134/S0005117910100024)
parallel dedicated machines
Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)
Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)
parametric decomposition
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
permutation
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
polynomial algorithm
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
polynomial-time algorithm
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)
precedence constraints
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)
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)
Gordon, V.S. and Strusevich, V.A. (1998) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26 (2). pp. 157-177. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(98)00055-0)
Strusevich, V.A. (1997) Shop scheduling problems under precedence constraints. Annals of Operations Research, 69. pp. 351-377. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018997431986)
priority-generating function
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
priority-generating functions
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)
production
Kubzin, M.A. and Strusevich, V.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:https://doi.org/10.1287/opre.1060.0301)
production-scheduling
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
removal time
Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M. (1997) Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24 (11). pp. 1025-1031. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(97)00018-X)
replacement
Kubzin, M.A. and Strusevich, V.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:https://doi.org/10.1287/opre.1060.0301)
resource constraints
Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)
scheduling
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
Potts, C.N. and Strusevich, V.A. (2009) Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society, 60 (S1). S41-S68. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/jors.2009.2)
Kubzin, M.A. and Strusevich, V.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:https://doi.org/10.1287/opre.1060.0301)
Kelleler, H. and Strusevich, V.A. (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics, 133 (1-3). pp. 45-68. ISSN 0166-218X (doi:https://doi.org/10.1016/S0166-218X(03)00433-5)
Potts, C.N., Strusevich, V.A. and Tautenhahn, T. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4 (1). pp. 25-51. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)
sequencing
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
setup time
Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M. (1997) Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24 (11). pp. 1025-1031. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(97)00018-X)
shop scheduling
Strusevich, V.A., Drobouchevitch, I.G. and Shakhlevich, N.V. (2002) Three-machine shop scheduling with partially ordered processing routes. Journal of the Operational Research Society, 53 (5). pp. 574-582. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/palgrave.jors.2601329)
Strusevich, V.A. (1997) Shop scheduling problems under precedence constraints. Annals of Operations Research, 69. pp. 351-377. ISSN 0254-5330 (Print), 1572-9338 (Online) (doi:https://doi.org/10.1023/A:1018997431986)
single machine scheduling
Gordon, V.S. and Strusevich, V.A. (2008) Schedules with due-date assignment and position-dependent processing times. Doklady of the National Academy of Sciences of Belarus, 52 (5). pp. 24-30. ISSN 0002-354X
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)
Gordon, V.S. and Strusevich, V.A. (1998) Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26 (2). pp. 157-177. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(98)00055-0)
suboptimal algorithms
Glass, C.A., Potts, C.N. and Strusevich, V.A. (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13 (2). pp. 120-137. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:https://doi.org/10.1287/ijoc.13.2.120.10521)
symmetric function
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
transportation time
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)
Rebaine, D. and Strusevich, V.A. (1999) Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society, 50. pp. 756-764. ISSN 0160-5682 (doi:https://doi.org/10.1057/palgrave.jors.2600769)
two machines
Rebaine, D. and Strusevich, V.A. (1999) Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society, 50. pp. 756-764. ISSN 0160-5682 (doi:https://doi.org/10.1057/palgrave.jors.2600769)
two-stage no-wait scheduling models
Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M. (1997) Two-stage no-wait scheduling models with setup and removal times separated. Computers & Operations Research, 24 (11). pp. 1025-1031. ISSN 0305-0548 (doi:https://doi.org/10.1016/S0305-0548(97)00018-X)
V S Tanaev
Gordon, V.S., Kovalyov, M. Ya, Levin, G.M., Sotskov, Yu N., Strusevich, V.A., Tuzikov, A.V. and Shafransky, Ya M. (2010) Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary. Automation and Remote Control, 71 (10). pp. 2021-2028. ISSN 0005-1179 (Print), 1608-3032 (Online) (doi:https://doi.org/10.1134/S0005117910100024)
Vyacheslav Tanaev
Gordon, V.S., Kovalyov, M.Y., Levin, G.M., Shafransky, Y.M., Sotskov, Y.N., Strusevich, V.A. and Tuzikov, A.V. (2011) Vyacheslav Tanaev: contributions to scheduling and related areas. Journal of Scheduling, 15 (4). pp. 403-418. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:https://doi.org/10.1007/s10951-011-0230-4)
worst-case analysis
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)
Strusevich, V.A., Drobouchevitch, I.G. and Shakhlevich, N.V. (2002) Three-machine shop scheduling with partially ordered processing routes. Journal of the Operational Research Society, 53 (5). pp. 574-582. ISSN 0160-5682 (Print), 1476-9360 (Online) (doi:https://doi.org/10.1057/palgrave.jors.2601329)
Kelleler, H. and Strusevich, V.A. (2002) Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research, 147 (2). pp. 345-364. ISSN 0377-2217 (doi:https://doi.org/10.1016/S0377-2217(02)00246-1)
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)
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)
Strusevich, V.A., van de Waart, A.J.A. and Dekker, R. (1999) A 3/2 algorithm for two-machine open shop with route-dependent processing times. Journal of Heuristics, 5 (1). pp. 5-28. ISSN 1381-1231 (Print), 1572-9397 (Online) (doi:https://doi.org/10.1023/A:1009643112214)
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)
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)