Narrow search
Showing 1 - 9 of 9
Cover Image
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
Cover Image
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
Cover Image
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
Cover Image
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
Cover Image
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
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/10010950358
Cover Image
On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule
Sotskov, Y.N.; Wagelmans, Wagelmans, A.P.M.; Werner, F. - Faculteit der Economische Wetenschappen, Erasmus … - 1997
The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the implementation of scheduling algorithms with a rather deep mathematical background in production...
Persistent link: https://www.econbiz.de/10010731643
Cover Image
On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule
Sotskov, Y.N.; Wagelmans, A.P.M.; Werner, F. - Erasmus University Rotterdam, Econometric Institute - 1997
The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the implementation of scheduling algorithms with a rather deep mathematical background in production...
Persistent link: https://www.econbiz.de/10008584745
Cover Image
Scheduling unrelated machines with two types of jobs
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
Cover Image
Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server
Hasani, Keramat; Kravčenko, Svetlana A.; Werner, Frank - In: International journal of production research 52 (2014) 13, pp. 3778-3792
Persistent link: https://www.econbiz.de/10010382879