| 2009 |
|---|
| 33 | EE | Gerd Finke,
Vitaly A. Strusevich,
Frank Werner:
Guest Editorial.
Computers & OR 36(2): 299-300 (2009) |
| 32 | EE | 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) |
| 31 | EE | 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 |
|---|
| 30 | EE | 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 |
| 29 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.
Algorithmica 51(4): 451-473 (2008) |
| 28 | EE | 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 |
|---|
| 27 | EE | 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) |
| 26 | EE | 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 |
|---|
| 25 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Single machine scheduling with controllable release and processing parameters.
Discrete Applied Mathematics 154(15): 2178-2199 (2006) |
| 24 | EE | 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) |
| 23 | EE | 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 |
|---|
| 22 | EE | Mikhail A. Kubzin,
Vitaly A. Strusevich:
Two-machine flow shop no-wait scheduling with machine maintenance.
4OR 3(4): 303-313 (2005) |
| 21 | EE | 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) |
| 20 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Pre-Emptive Scheduling Problems with Controllable Processing Times.
J. Scheduling 8(3): 233-253 (2005) |
| 19 | EE | 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) |
| 18 | EE | 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 |
|---|
| 17 | EE | 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) |
| 16 | EE | 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) |
| 15 | EE | 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 |
|---|
| 14 | EE | 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) |
| 13 | EE | Hans Kellerer,
Vitaly A. Strusevich:
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discrete Applied Mathematics 133(1-3): 45-68 (2003) |
| 12 | EE | 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 |
|---|
| 11 | EE | 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) |
| 10 | EE | 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 |
|---|
| 9 | EE | 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 |
|---|
| 8 | EE | 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) |
| 7 | EE | 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) |
| 6 | | 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 |
|---|
| 5 | | 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 |
|---|
| 4 | EE | 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) |
| 3 | EE | 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 |
|---|
| 2 | EE | 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 |
|---|
| 1 | EE | Vitaly A. Strusevich:
Two machine open shop scheduling problem with setup, processing and removal times separated.
Computers & OR 20(6): 597-611 (1993) |
