#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1994

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yuri N. Sotskov, Natalia V. Shakhlevich
- Discrete Applied Mathematics
- 1995

- Yuri N. Sotskov, Natalja G. Egorova, T.-C. Lai
- Mathematical and Computer Modelling
- 2009

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t We consider a single-machine scheduling problem with each job having… (More)

This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given.… (More)

- Yuri N. Sotskov, Alexandre Dolgui, Marie-Claude Portmann
- European Journal of Operational Research
- 2006

- Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov
- Computers & OR
- 2002

- Yuri N. Sotskov, V. K. Leont'ev, Evgenii N. Gordeev
- Discrete Applied Mathematics
- 1995

This paper surveys the recent results in stability analysis for discrete optimization problems, such as a traveling salesman problem, an assignment problem, a shortest path problem, a Steiner problem, a scheduling problem and so on. The terms " stability " , " sensitivity " or " postoptimal analysis " are generally used for the phase of an algorithm at… (More)

- Yuri N. Sotskov, T.-C. Lai
- Computers & OR
- 2012

Keywords: Single-machine scheduling Total weighted flow time Interval input data Stability analysis a b s t r a c t We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value on a given closed interval. The criterion is to minimize the total weighted flow time of the n jobs, where there is a… (More)

- Peter Brucker, Yuri N. Sotskov, Frank Werner
- Math. Meth. of OR
- 2007

- Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner
- RAIRO - Operations Research
- 1999

- Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
- European Journal of Operational Research
- 2004

We consider a job shop scheduling problem under uncertain processing times and fixed precedence and capacity constraints. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible… (More)