Follow
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
2121995
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, 81-106, 2004
822004
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
812014
Complexity of mixed shop scheduling problems: A survey
NV Shakhlevich, YN Sotskov, F Werner
European Journal of Operational Research 120 (2), 343-351, 2000
772000
Complexity of mixed shop scheduling problems: A survey
NV Shakhlevich, YN Sotskov, F Werner
European Journal of Operational Research 120 (2), 343-351, 2000
732000
Minimizing total weighted completion time in a proportionate flow shop
N Shakhlevich, H Hoogeveen, M Pinedo
Journal of scheduling 1 (3), 157-168, 1998
661998
Common due date assignment and scheduling with ready times
TCE Cheng, ZL Chen, NV Shakhlevich
Computers & Operations Research 29 (14), 1957-1967, 2002
572002
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
512013
Pre-emptive scheduling problems with controllable processing times
NV Shakhlevich, VA Strusevich
Journal of Scheduling 8, 233-253, 2005
502005
Inverse scheduling with maximum lateness objective
P Brucker, NV Shakhlevich
Journal of Scheduling 12, 475-488, 2009
482009
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
442018
Single machine scheduling with controllable release and processing parameters
NV Shakhlevich, VA Strusevich
Discrete Applied Mathematics 154 (15), 2178-2199, 2006
432006
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
422016
Inverse scheduling: two-machine flow-shop problem
P Brucker, NV Shakhlevich
Journal of Scheduling 14, 239-256, 2011
422011
Parallel batch scheduling of equal-length jobs with release and due dates
A Condotta, S Knust, NV Shakhlevich
Journal of Scheduling 13, 463-477, 2010
332010
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
332006
Proportionate flow shop with controllable processing times
TC Edwin Cheng, N Shakhlevich
Journal of Scheduling 2 (6), 253-265, 1999
331999
Preemptive scheduling on uniform parallel machines with controllable job processing times
NV Shakhlevich, VA Strusevich
Algorithmica 51, 451-473, 2008
302008
Scheduling coupled-operation jobs with exact time-lags
A Condotta, NV Shakhlevich
Discrete Applied Mathematics 160 (16-17), 2370-2388, 2012
282012
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs
NV Shakhlevich, N Sotskov, F Werner
Annals of operations research 92 (0), 281-304, 1999
281999
The system can't perform the operation now. Try again later.
Articles 1–20