Sotskov Y.N.

Y.N. Sotskov

Information about the author Y.N. Sotskov will soon be added to the site.
Found 10 papers in total
Finding the optimal order for processing two conflict jobs
Finding the optimal order for processing two conflict jobs
2006
The two-machine flow-shop scheduling problem with uncertain and bounded processing...
Flowshop scheduling problem to minimize total completion time with random and bounded processing times
Flowshop scheduling problem to minimize total completion time with random and bounded processing times
2004
The flowshop scheduling problems with n jobs processed on two or three machines, and...
Minimization of project-network with given bounds of activity durations
Minimization of project-network with given bounds of activity durations
2004
Efficient algorithms are developed to delete from the given project-network all...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999
Constructive heuristics for shop scheduling problems are often based on priority (or...
Sequencing with uncertain numerical data for makespan minimisation
Sequencing with uncertain numerical data for makespan minimisation
1999
We consider a scheduling problem with the objective of minimising the makespan under...
Preemptive job-shop scheduling problems with a fixed number of jobs
Preemptive job-shop scheduling problems with a fixed number of jobs
1999
It is shown that the two machine preemptive job-shop problem with mean flow-time or...
Optimal makespan schedule for three jobs on two machines
Optimal makespan schedule for three jobs on two machines
1996
This paper deals with the problem of scheduling three jobs on two machines in order to...
Heuristics for permutation flow stop scheduling with batch setup times
Heuristics for permutation flow stop scheduling with batch setup times
1996
In this paper the authors consider permutation flow shop scheduling problems with...
On the complexity of two machine job-shop scheduling with regular objective functions
On the complexity of two machine job-shop scheduling with regular objective functions
1997
For the nonpreemptive two machine job-shop scheduling problem with a fixed number of...
Stability of an optimal schedule
Stability of an optimal schedule
1991
This paper deals with the problem of optimal scheduling n uninterrupted operations on...
Papers per page: