#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1998

2018

- This year (1)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

We consider a single-machine scheduling problem with each job having an uncertain processing time which can take any real value within each corresponding closed interval before completing the job.â€¦ (More)

ï£§This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processingâ€¦ (More)

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective

- Yuri N. Sotskov, Natalja G. Egorova
- Algorithms
- 2018

We consider a single machine scheduling problem with uncertain durations of the given jobs. The objective function is minimizing the sum of the job completion times. We apply the stability approachâ€¦ (More)

- Svetlana Kurilovich, I A Jakuschenko, Natalja G. Egorova, A V Avksentyuk, V B Trusov
- International journal of circumpolar health
- 1998

The characteristics of alcohol-induced flushing response were studied in some Siberian Native populations (Chukchi, Eskimo, Jakuts, Udege, and Nanaian). Flushing peculiarities were estimated and theâ€¦ (More)

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can takeâ€¦ (More)

- J A Frontera, Louis Aledort, +5 authors Florent Sehba
- Journal of thrombosis and haemostasis : JTH
- 2012

ciation scan identifies a susceptibility locus for venous thrombosis on chromosome 6p24.1. Am J Hum Genet 2010; 86: 592â€“5. 18 Glynn RJ, Danielson E, Fonseca FAH, Genest J, Gotto AM, Kastelein JJP,â€¦ (More)

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup and removal times. The processing of eachâ€¦ (More)

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

This paper addresses the issue of how to best execute the schedule in a two-phase scheduling decision framework by considering a two-machine flow-shop scheduling problem in which each uncertainâ€¦ (More)

- Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner
- SIMULTECH
- 2011

We consider a single-machine scheduling problem, in which the processing time of a job can take any value from a given segment. The criterion is to minimize the sum of weighted completion times ofâ€¦ (More)

- Yuri N. Sotskov, Natalja G. Egorova
- Automation and Remote Control
- 2014

- â€¹
- 1
- â€º