Natalia V. Shakhlevich
Natalia V. Shakhlevich
Verified email at leeds.ac.uk
Title
Cited by
Cited by
Year
NP-hardness of shop-scheduling problems with three jobs
YN Sotskov, NV Shakhlevich
Discrete Applied Mathematics 59 (3), 237-266, 1995
1651995
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
P Brucker, S Knust, TCE Cheng, NV Shakhlevich
Annals of Operations Research 129 (1), 81-106, 2004
702004
Complexity of mixed shop scheduling problems: A survey
NV Shakhlevich, YN Sotskov, F Werner
European Journal of Operational Research 120 (2), 343-351, 2000
692000
Complexity of mixed shop scheduling problems: A survey
NV Shakhlevich, YN Sotskov, F Werner
European Journal of Operational Research 120 (2), 343-351, 2000
652000
Minimizing total weighted completion time in a proportionate flow shop
N Shakhlevich, H Hoogeveen, M Pinedo
Journal of scheduling 1 (3), 157-168, 1998
581998
Scheduling patient appointments via multilevel template: A case study in chemotherapy
A Condotta, NV Shakhlevich
Operations Research for Health Care 3 (3), 129-144, 2014
552014
Common due date assignment and scheduling with ready times
TCE Cheng, ZL Chen, NV Shakhlevich
Computers & Operations Research 29 (14), 1957-1967, 2002
522002
Pre-emptive scheduling problems with controllable processing times
NV Shakhlevich, VA Strusevich
Journal of Scheduling 8 (3), 233-253, 2005
512005
Tabu search and lower bounds for a combined production–transportation problem
A Condotta, S Knust, D Meier, NV Shakhlevich
Computers & Operations Research 40 (3), 886-900, 2013
412013
Single machine scheduling with controllable release and processing parameters
NV Shakhlevich, VA Strusevich
Discrete Applied Mathematics 154 (15), 2178-2199, 2006
392006
Scheduling with controllable release dates and processing times: Makespan minimization
TCE Cheng, MY Kovalyov, NV Shakhlevich
European Journal of Operational Research 175 (2), 751-768, 2006
362006
Inverse scheduling with maximum lateness objective
P Brucker, NV Shakhlevich
Journal of Scheduling 12 (5), 475-488, 2009
332009
Proportionate flow shop with controllable processing times
TC Edwin Cheng, N Shakhlevich
Journal of Scheduling 2 (6), 253-265, 1999
311999
Complexity results for storage loading problems with stacking constraints
F Bruns, S Knust, NV Shakhlevich
European Journal of Operational Research 249 (3), 1074-1081, 2016
302016
Parallel batch scheduling of equal-length jobs with release and due dates
A Condotta, S Knust, NV Shakhlevich
Journal of Scheduling 13 (5), 463-477, 2010
302010
Preemptive scheduling on uniform parallel machines with controllable job processing times
NV Shakhlevich, VA Strusevich
Algorithmica 51 (4), 451-473, 2008
302008
Inverse scheduling: two-machine flow-shop problem
P Brucker, NV Shakhlevich
Journal of Scheduling 14 (3), 239-256, 2011
282011
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches
A Shioura, NV Shakhlevich, VA Strusevich
European Journal of Operational Research 266 (3), 795-818, 2018
272018
Scheduling with controllable release dates and processing times: Total completion time minimization
TCE Cheng, MY Kovalyov, NV Shakhlevich
European Journal of Operational Research 175 (2), 769-781, 2006
262006
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
A Shioura, NV Shakhlevich, VA Strusevich
INFORMS Journal on Computing 28 (1), 148-161, 2016
242016
The system can't perform the operation now. Try again later.
Articles 1–20