Similar Search Results

Theoretical Papers - Sequencing with uncertain numerical data for makespan minimisation

Lai, T.-C.; Sotskov, Y.N. - In: Journal of the Operational Research Society : OR 50 (1999) 3, pp. 230-243

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

Flowshop scheduling problem to minimize total completion time with random and bounded processing times

Sotskov, Y.N.; Allahverdi, A.; Lai, T.-C. - In: Journal of the Operational Research Society : OR 55 (2004) 3, pp. 277-286

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

Perspectives in the Latin American growth centres

Braun, O. - In: Development of societies : the next twenty-five years; …, (pp. 245-255). 1979

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

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

Lai, T.-C. - In: Operations research letters 14 (1993) 4, pp. 215-220

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

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

A heuristic decomposition algorithm for scheduling problems on mixed graphs

Krüger, K.; Shakhlevich, N.V.; Sotskov, Y.N.; Werner, F. - In: Journal of the Operational Research Society : OR 46 (1995) 12, pp. 1481-1497

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

Heuristics for generalized shop scheduling problems based on decomposition

Krüger, K.; Sotskov, Y.N.; Werner, F. - In: International journal of production research : American … 36 (1998) 11, pp. 3013-3034

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

Optimal Makespan Schedule for Three Jobs on Two Machines

Kravchenko, S.A.; Sotskov, Y.N. - In: Mathematical methods of operations research 43 (1996) 3, pp. 233-238

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

On the complexity of two machine job-shop scheduling with regular objective functions

Brucker, P.; Kravchenko, S.A.; Sotskov, Y.N. - In: Operations-Research-Spektrum : Zeitschrift der … 19 (1997) 1, pp. 5-10

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

Heuristics for permutation flow shop scheduling with batch setup times

Sotskov, Y.N.; Tautenhahn, T.; Werner, F. - In: Operations-Research-Spektrum : Zeitschrift der … 18 (1996) 2, pp. 67-80

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