Search Results - "Sotskov, Yuri"

The stability radius of an optimal line balance with maximum efficiency for a simple assembly line by Lai, Tsung-Chyan, Sotskov, Yuri N., Dolgui, Alexandre

“…•A criterion for a zero stability radius of the line balance is proven.•A criterion for an infinite stability radius of the line balance is proven.•Lower and…”
Get full text

Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives by Sotskov, Yuri N.

“…Assembly lines (conveyors) are traditional means of large-scale and mass-scale productions. An assembly line balancing problem is needed for optimizing the…”
Get full text

Stability of a schedule minimising the makespan for processing jobs on identical machines by Sotskov, Yuri N.

“…A set of jobs has to be processed on identical machines. Every job may be processed on any available machine without preemptions. The criterion is to minimise…”
Get full text

Mixed graph model and algorithms for parallel-machine job-shop scheduling problems by Sotskov, Yuri N., Gholami, Omid

“…Heuristic algorithms are developed to solve the parallel-machine job-shop problems , where the criterion is the minimisation of the makespan, , or the sum of…”
Get full text

Stability radii of optimal assembly line balances with a fixed workstation set by Lai, Tsung-Chyan, Sotskov, Yuri N., Dolgui, Alexandre, Zatsiupa, Aksana

“…For an assembly line, it is required to minimize the line's cycle time for processing a partially ordered set of the assembly operations on a linearly ordered…”
Get full text

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates by Mihova, Evangelina I., Sotskov, Yuri N.

“…We investigate relationships between scheduling problems with the bottleneck objective functions (minimising makespan or maximal lateness) and problems of…”
Get full text

Mixed Graph Colorings: A Historical Review by Sotskov, Yuri N.

“…This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A…”
Get full text

Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines by Sotskov, Yuri N., Dolgui, Alexandre, Lai, Tsung-Chyan, Zatsiupa, Aksana

“…•Simple assembly line balancing problems are studied.•Stability of line balances with respect to variations of processing times is investigated.•Algorithms for…”
Get full text

The optimality box in uncertain data for minimising the sum of the weighted job completion times by Lai, Tsung-Chyan, Sotskov, Yuri N., Egorova, Natalja G., Werner, Frank

“…An uncertain single-machine scheduling problem is considered, where the processing time of a job can take any real value from a given segment. The criterion is…”
Get full text

Optimization of Selection and Use of a Machine and Tractor Fleet in Agricultural Enterprises: A Case Study by Efremov, Andrei A., Sotskov, Yuri N., Belotzkaya, Yulia S.

“…This article presents a realized application of a model and algorithm to optimize the formation and use of a machine and tractor fleet of an agricultural…”
Get full text

Solving parallel machines job-shop scheduling problems by an adaptive algorithm by Gholami, Omid, Sotskov, Yuri N.

“…A parallel machines job-shop problem is a generalisation of a job-shop problem to the case when there are identical machines of the same type. Job-shop…”
Get full text

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective by Sotskov, Yuri, Egorova, Natalja

“…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…”
Get full text

Special Issue on Algorithms for Scheduling Problems by Werner, Frank, Burtseva, Larysa, Sotskov, Yuri

“…This special issue of Algorithms is devoted to the development of scheduling algorithms based on innovative approaches for solving hard scheduling problems…”
Get full text

Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem by Sotskov, Yuri N., Mihova, Evangelina I.

“…This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness Lmax for integer due dates to the…”
Get full text

Special Issue on Exact and Heuristic Scheduling Algorithms by Werner, Frank, Burtseva, Larysa, Sotskov, Yuri N.

“…This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted…”
Get full text

Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations by Sotskov, Yuri N., Matsveichuk, Natalja M., Hatsura, Vadzim D.

“…We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the…”
Get full text

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems by Gholami, Omid, Sotskov, Yuri N.

“…We consider a multistage processing system, which includes both identical (parallel) machines that can process the same set of operations and different…”
Get full text

Stability analysis of an optimal balance for an assembly line with fixed cycle time by Sotskov, Yuri N., Dolgui, Alexandre, Portmann, Marie-Claude

“…We address the simple assembly line balancing problem: minimize the number of stations m for processing n partially ordered operations V = {1, 2, …, n} within…”
Get full text

Measures of problem uncertainty for scheduling with interval processing times by Sotskov, Yuri N., Lai, Tsung-Chyan, Werner, Frank

“…The paper deals with scheduling under uncertainty of the job processing times. The actual value of the processing time of a job becomes known only when the…”
Get full text

Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness by Gholami, Omid, Sotskov, Yuri N.

“…The problem of generating a train schedule for a single-track railway system is addressed in this article. A three stage scheduling is proposed to reduce the…”
Get full text