Vitaly A. Strusevich

	2009
37		Gerd Finke, Vitaly A. Strusevich, Frank Werner: Guest Editorial. Computers & OR 36(2): 299-300 (2009)
36		Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich: Approximation results for flow shop scheduling problems with machine availability constraints. Computers & OR 36(2): 379-390 (2009)
35		Valery S. Gordon, Vitaly A. Strusevich: Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research 198(1): 57-62 (2009)
34		Hans Kellerer, Mikhail A. Kubzin, Vitaly 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 199(1): 111-116 (2009)
33		Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich: Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20(2): 247-269 (2009)
	2008
32		Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich: Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA 2008: 756-767
31		Natalia V. Shakhlevich, Vitaly A. Strusevich: Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51(4): 451-473 (2008)
30		Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead: Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J. Scheduling 11(5): 357-370 (2008)
	2007
29		Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich: On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. Electronic Notes in Discrete Mathematics 29: 169-173 (2007)
28		Alan J. Soper, Vitaly A. Strusevich: An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter. Int. J. Found. Comput. Sci. 18(3): 565-591 (2007)
	2006
27		Natalia V. Shakhlevich, Vitaly A. Strusevich: Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics 154(15): 2178-2199 (2006)
26		Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra: Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper. Res. Lett. 34(4): 459-464 (2006)
25		Mikhail A. Kubzin, Vitaly A. Strusevich: Planning Machine Maintenance in Two-Machine Shop Scheduling. Operations Research 54(4): 789-800 (2006)
24		Hans Kellerer, Vitaly A. Strusevich: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor. Comput. Sci. 369(1-3): 230-238 (2006)
	2005
23		Mikhail A. Kubzin, Vitaly A. Strusevich: Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3(4): 303-313 (2005)
22		Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich: Two-machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research 167(3): 796-809 (2005)
21		Natalia V. Shakhlevich, Vitaly A. Strusevich: Pre-Emptive Scheduling Problems with Controllable Processing Times. J. Scheduling 8(3): 233-253 (2005)
20		Vitaly A. Strusevich: Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. Oper. Res. Lett. 33(2): 217-219 (2005)
19		Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich: Two-machine flow shop scheduling problems with no-wait jobs. Oper. Res. Lett. 33(3): 255-262 (2005)
	2004
18		Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich: Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Annals OR 129(1-4): 171-185 (2004)
17		Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich: Batching decisions for assembly production systems. European Journal of Operational Research 157(3): 620-642 (2004)
16		Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich: Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. J. Comb. Optim. 8(1): 13-28 (2004)
	2003
15		Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich: Preface: International Symposium on Combinatorial Optimisation. Discrete Applied Mathematics 133(1-3): 1-2 (2003)
14		Hans Kellerer, Vitaly A. Strusevich: Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics 133(1-3): 45-68 (2003)
13		Hans Kellerer, Vitaly A. Strusevich: Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research 147(2): 345-364 (2003)
	2001
12		Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich: Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS Journal on Computing 13(2): 120-137 (2001)
11		Joachim Breit, Günter Schmidt, Vitaly A. Strusevich: Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2): 65-77 (2001)
	2000
10		Vitaly A. Strusevich: Group technology approach to the open shop scheduling problem with batch setup times. Oper. Res. Lett. 26(4): 181-192 (2000)
	1999
9		Valery S. Gordon, Vitaly A. Strusevich: Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & OR 26(2): 157-177 (1999)
8		Vitaly A. Strusevich: A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. Discrete Applied Mathematics 93(2-3): 287-304 (1999)
7		Vitaly A. Strusevich, A. J. A. van de Waart, R. Dekker: A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times. J. Heuristics 5(1): 5-28 (1999)
	1998
6		Bo Chen, Chris N. Potts, Vitaly A. Strusevich: Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Program. 82: 255-271 (1998)
	1997
5		Jatinder N. D. Gupta, Vitaly A. Strusevich, C. M. Zwaneveld: Two-stage no-wait scheduling models with setup and removal times separated. Computers & OR 24(11): 1025-1031 (1997)
4		Vitaly A. Strusevich, L. A. Hall: An open shop scheduling problem with a non-bottleneck machine. Oper. Res. Lett. 21(1): 11-18 (1997)
	1995
3		Vitaly A. Strusevich: Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. Discrete Applied Mathematics 59(1): 75-86 (1995)
	1993
2		Vitaly A. Strusevich: Two machine open shop scheduling problem with setup, processing and removal times separated. Computers & OR 20(6): 597-611 (1993)
1		Bo Chen, Vitaly A. Strusevich: Approximation Algorithms for Three-Machine Open Shop Scheduling. INFORMS Journal on Computing 5(3): 321-326 (1993)

Coauthor Index

1	Jean-Charles Billaut	[19] [22]
2	Jean-Louis Bouquard	[19]
3	Joachim Breit	[11]
4	Bo Chen	[1] [6]
5	R. Dekker	[7]
6	Richard W. Eglese	[15]
7	Carl Esswein	[22]
8	Martin G. Everett	[15]
9	Gerd Finke	[37]
10	Andrei A. Gladky	[16]
11	Celia A. Glass	[12]
12	Valery S. Gordon	[9] [29] [30] [35]
13	Irina V. Gribkovskaia	[26]
14	Jatinder N. D. Gupta	[5] [18]
15	L. A. Hall	[4]
16	Hans Kellerer	[13] [14] [24] [34]
17	Christos Koulamas	[18]
18	Mikhail Y. Kovalyov	[17]
19	Mikhail A. Kubzin	[19] [23] [25] [34] [36]
20	George J. Kyparisis	[18]
21	Chung-Yee Lee	[26]
22	Yury L. Orlovich	[29]
23	Chris N. Potts	[6] [12] [15] [17] [18] [29] [30] [36]
24	Günter Schmidt	[11]
25	Yakov M. Shafransky	[16]
26	Natalia V. Shakhlevich	[21] [27] [31] [32] [33]
27	Akiyoshi Shioura	[32] [33]
28	Alan J. Soper	[28]
29	A. J. A. van de Waart	[7]
30	Frank Werner	[37]
31	Dominique de Werra	[26]
32	J. Douglass Whitehead	[30]
33	C. M. Zwaneveld	[5]

Colors in the list of coauthors