Natalia V. Shakhlevich - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Inverse scheduling: two-machine flow-shop problemPeter Brucker, Natalia V. Shakhlevich. scheduling, 14(3):239-256, 2011. [doi]

A polynomial-time algorithm for a flow-shop batching problem with equal-length operationsPeter Brucker, Natalia V. Shakhlevich. scheduling, 14(4):371-389, 2011. [doi]

2010

Parallel batch scheduling of equal-length jobs with release and due datesAlessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich. scheduling, 13(5):463-477, 2010. [doi]

2009

Inverse scheduling with maximum lateness objectivePeter Brucker, Natalia V. Shakhlevich. scheduling, 12(5):475-488, 2009. [doi]

Single Machine Scheduling with Controllable Processing Times by submodular OptimizationNatalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich. ijfcs, 20(2):247-269, 2009. [doi]

2008

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing TimesNatalia V. Shakhlevich, Vitaly A. Strusevich. algorithmica, 51(4):451-473, 2008. [doi]

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization ApproachNatalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich. esa 2008: 756-767 [doi]

2007

Two-machine open shop problem with controllable processing timesT. C. Edwin Cheng, Natalia V. Shakhlevich. disopt, 4(2):175-184, 2007. [doi]

2006

Scheduling with controllable release dates and processing times: Total completion time minimizationT. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich. eor, 175(2):769-781, 2006. [doi]

Scheduling with controllable release dates and processing times: Makespan minimizationT. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich. eor, 175(2):751-768, 2006. [doi]

Single machine scheduling with controllable release and processing parametersNatalia V. Shakhlevich, Vitaly A. Strusevich. DAM, 154(15):2178-2199, 2006. [doi]

2005

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problemT. C. Edwin Cheng, Natalia V. Shakhlevich. eor, 165(2):444-456, 2005. [doi]

Pre-Emptive Scheduling Problems with Controllable Processing TimesNatalia V. Shakhlevich, Vitaly A. Strusevich. scheduling, 8(3):233-253, 2005. [doi]

Open shop unit-time scheduling problems with symmetric objective functionsNatalia V. Shakhlevich. 4or, 3(2):117-131, 2005. [doi]

2004

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation DelaysPeter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich. anor, 129(1-4):81-106, 2004. [doi]

2002

Common due date assignment and scheduling with ready timesT. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich. cor, 29(14):1957-1967, 2002. [doi]

2000

Complexity of mixed shop scheduling problems: A surveyNatalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner. eor, 120(2):343-351, 2000. [doi]

1995

NP-hardness of Shop-scheduling Problems with Three JobsYuri N. Sotskov, Natalia V. Shakhlevich. DAM, 59(3):237-266, 1995. [doi]

1994

Scheduling two jobs with fixed and nonfixed routesNatalia V. Shakhlevich, Yuri N. Sotskov. computing, 52(1):17-30, 1994. [doi]