NP-hardness of shop-scheduling problems with three jobs YN Sotskov, NV Shakhlevich Discrete Applied Mathematics 59 (3), 237-266, 1995 | 215 | 1995 |
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 | 82 | 2014 |
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 | 82 | 2004 |
Complexity of mixed shop scheduling problems: A survey NV Shakhlevich, YN Sotskov, F Werner European Journal of Operational Research 120 (2), 343-351, 2000 | 77 | 2000 |
Minimizing total weighted completion time in a proportionate flow shop N Shakhlevich, H Hoogeveen, M Pinedo Journal of scheduling 1 (3), 157-168, 1998 | 66 | 1998 |
Common due date assignment and scheduling with ready times TCE Cheng, ZL Chen, NV Shakhlevich Computers & Operations Research 29 (14), 1957-1967, 2002 | 57 | 2002 |
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 | 51 | 2013 |
Inverse scheduling with maximum lateness objective P Brucker, NV Shakhlevich Journal of Scheduling 12, 475-488, 2009 | 50 | 2009 |
Pre-emptive scheduling problems with controllable processing times NV Shakhlevich, VA Strusevich Journal of Scheduling 8, 233-253, 2005 | 50 | 2005 |
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 | 45 | 2018 |
Inverse scheduling: two-machine flow-shop problem P Brucker, NV Shakhlevich Journal of Scheduling 14, 239-256, 2011 | 43 | 2011 |
Single machine scheduling with controllable release and processing parameters NV Shakhlevich, VA Strusevich Discrete Applied Mathematics 154 (15), 2178-2199, 2006 | 43 | 2006 |
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 | 42 | 2016 |
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 | 33 | 2010 |
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 | 33 | 2006 |
Proportionate flow shop with controllable processing times TC Edwin Cheng, N Shakhlevich Journal of Scheduling 2 (6), 253-265, 1999 | 33 | 1999 |
Preemptive scheduling on uniform parallel machines with controllable job processing times NV Shakhlevich, VA Strusevich Algorithmica 51, 451-473, 2008 | 30 | 2008 |
Scheduling coupled-operation jobs with exact time-lags A Condotta, NV Shakhlevich Discrete Applied Mathematics 160 (16-17), 2370-2388, 2012 | 28 | 2012 |
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 | 28 | 1999 |
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 | 27 | 2016 |