Similar Search Results

Minimising interference for scheduling two parallel machines with a single server

Hasani, Keramat; Kravčenko, Svetlana A.; Werner, Frank - In: International journal of production research 52 (2014) 24, pp. 7148-7158

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

Preemptive job-shop scheduling problems with a fixed number of jobs

Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. - In: Computational Statistics 49 (1999) 1, pp. 41-76

It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also...

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

Preemptive job-shop scheduling problems with a fixed number of jobs

Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. - In: Mathematical Methods of Operations Research 49 (1999) 1, pp. 41-76

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

Vakhania, Nodari; Hernandez, Jose Alberto; Werner, Frank - In: International journal of production research 52 (2014) 13, pp. 3793-3801

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

Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions

Ivanov, Dmitry; Dolgui, Alexandre; Sokolov, Boris; … - In: International journal of production research 54 (2016) 11/12, pp. 3397-3413

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

The optimality box in uncertain data for minimising the sum of the weighted job completion times

Lai, Tsung-Chyan; Sotskov, Jurij Nazarovič; Egorova, … - In: International journal of production research 56 (2018) 19, pp. 6336-6362

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