| 2009 |
|---|
| 13 | 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 |
|---|
| 12 | 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 |
| 11 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.
Algorithmica 51(4): 451-473 (2008) |
| 2007 |
|---|
| 10 | EE | T. C. Edwin Cheng,
Natalia V. Shakhlevich:
Two-machine open shop problem with controllable processing times.
Discrete Optimization 4(2): 175-184 (2007) |
| 2006 |
|---|
| 9 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Single machine scheduling with controllable release and processing parameters.
Discrete Applied Mathematics 154(15): 2178-2199 (2006) |
| 8 | EE | T. C. Edwin Cheng,
Mikhail Y. Kovalyov,
Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Makespan minimization.
European Journal of Operational Research 175(2): 751-768 (2006) |
| 7 | EE | T. C. Edwin Cheng,
Mikhail Y. Kovalyov,
Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Total completion time minimization.
European Journal of Operational Research 175(2): 769-781 (2006) |
| 2005 |
|---|
| 6 | EE | Natalia V. Shakhlevich:
Open shop unit-time scheduling problems with symmetric objective functions.
4OR 3(2): 117-131 (2005) |
| 5 | EE | T. C. Edwin Cheng,
Natalia V. Shakhlevich:
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.
European Journal of Operational Research 165(2): 444-456 (2005) |
| 4 | EE | Natalia V. Shakhlevich,
Vitaly A. Strusevich:
Pre-Emptive Scheduling Problems with Controllable Processing Times.
J. Scheduling 8(3): 233-253 (2005) |
| 2004 |
|---|
| 3 | EE | Peter Brucker,
Sigrid Knust,
T. C. Edwin Cheng,
Natalia V. Shakhlevich:
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
Annals OR 129(1-4): 81-106 (2004) |
| 2002 |
|---|
| 2 | EE | T. C. Edwin Cheng,
Zhi-Long Chen,
Natalia V. Shakhlevich:
Common due date assignment and scheduling with ready times.
Computers & OR 29(14): 1957-1967 (2002) |
| 1995 |
|---|
| 1 | EE | Yuri N. Sotskov,
Natalia V. Shakhlevich:
NP-hardness of Shop-scheduling Problems with Three Jobs.
Discrete Applied Mathematics 59(3): 237-266 (1995) |
