Similar Search Results

Scheduling with controllable release dates and processing times: Total completion time minimization

Cheng, T.C. Edwin; Kovalyov, Mikhail Y.; Shakhlevich, … - In: European Journal of Operational Research 175 (2006) 2, pp. 769-781

Persistent link: https://www.econbiz.de/10005283378

Special issue on scheduling in batch-processing industries and supply chains

Cheng, T.C. Edwin; Ng, C.T. Daniel; Kovalyov, Mikhail Y. - In: International Journal of Production Economics 105 (2007) 2, pp. 299-300

Persistent link: https://www.econbiz.de/10005414098

Fixed interval scheduling: Models, applications, computational complexity and algorithms

Kovalyov, Mikhail Y.; Ng, C.T.; Cheng, T.C. Edwin - In: European Journal of Operational Research 178 (2007) 2, pp. 331-342

Persistent link: https://www.econbiz.de/10005337234

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

Cheng, T. C. Edwin; Shakhlevich, Natalia V. - In: European Journal of Operational Research 165 (2005) 2, pp. 444-456

Persistent link: https://www.econbiz.de/10005151908

Complexity of mixed shop scheduling problems: A survey

Shakhlevich, Natalia V.; Sotskov, Yuri N.; Werner, Frank - In: European Journal of Operational Research 120 (2000) 2, pp. 343-351

Persistent link: https://www.econbiz.de/10005257065

Minimising the number of gap-zeros in binary matrices

Chakhlevitch, Konstantin; Glass, Celia A.; Shakhlevich, … - In: European Journal of Operational Research 229 (2013) 1, pp. 48-58

We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation Problem, and is known to be NP-hard. An analysis of the...

Persistent link: https://www.econbiz.de/10010664718

Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines

Shioura, Akiyoshi; Shakhlevich, Natasha; Strusevich, … - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 148-161

Persistent link: https://www.econbiz.de/10011453812

Complexity results for storage loading problems with stacking constraints

Bruns, Florian; Knust, Sigrid; Shakhlevich, Natasha - In: European journal of operational research : EJOR 249 (2016) 3, pp. 1074-1081

Persistent link: https://www.econbiz.de/10011439297

Machine speed scaling by adapting methods for convex optimization with submodular constraints

Shioura, Akiyoshi; Shakhlevich, Natasha; Strusevich, … - In: INFORMS journal on computing : JOC 29 (2017) 4, pp. 724-736

Persistent link: https://www.econbiz.de/10011772457

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines

Brucker, Peter; Shakhlevich, Natasha - In: Journal of scheduling 19 (2016) 6, pp. 659-685

Persistent link: https://www.econbiz.de/10011645857

1
2
3
4
5
6
7
8
9
Next
Last