|
|
|
|
|
Andrei A. Efremov, Yuri N. Sotskov and Yulia S. Belotzkaya
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 enterprise in crop farming. The concepts and indicators characterizing the processes of agricultural...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov
Assembly lines (conveyors) are traditional means of large-scale and mass-scale productions. An assembly line balancing problem is needed for optimizing the assembly process by configuring and designing an assembly line for the same or similar types of fi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov and Evangelina I. Mihova
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness ??max
L
max
for integer due dates to the scheduling problem, where along with precedence constraints given on the set ??={??1,??2,??,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Werner, Larysa Burtseva and Yuri N. Sotskov
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 to the development of exact and heuristic scheduling algorithms. Submissions were welcome both...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov, Natalja M. Matsveichuk and Vadzim D. Hatsura
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 job duration remains unknown until completing the job. The objective is to minimize the makespan ...
ver más
|
|
|
|
|
|