Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Sistemnì Doslìdženâ ...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Heuristic algorithms for constructing effective sequences of tasks on one machine in interconnected production systems

Authors: Zack, Yuriy O.;

Heuristic algorithms for constructing effective sequences of tasks on one machine in interconnected production systems

Abstract

The classical task in the theory of scheduling which is the task of constructing a sequence of tasks on one machine, taking into account not only the time spent on equipment operation, but also the loss of post-processing, is considered for multi-stage production systems consisting of an interconnected chain of sections and workshops of an industrial enterprise. As an optimality criterion, the implementation of a multi-stage schedule in the shortest possible time is considered. Methods are proposed for calculating the lower bound on the length of the optimal pattern along with heuristic algorithms for obtaining approximate solutions that require small amounts of computation. The proposed algorithms are illustrated by numerical examples.

Классическая в теории расписаний задача построения последовательности выполнения заданий на одной машине, учитывающая не только затраты времени на работу оборудования, но и потери на постобработку, рассматривается для многостадийных производственных систем, состоящих из взаимосвязанной цепочки участков и цехов промышленного предприятия. В качестве критерия оптимальности рассматривается выполнение многостадийного расписания в кратчайшие сроки. Предложены методы расчета нижней границы длины оптимального расписания и эвристические алгоритмы получения приближенных решений, требующие небольших объемов вычислений. Предложенные алгоритмы иллюстрируются числовыми примерами.

Класичне в теорії розкладів завдання побудови послідовності виконання завдань на одній машині, що враховує не тільки витрати часу на роботу обладнання, а й на постоброблення, розглядається для багатостадійних виробничих систем, що складається із взаємозалежного ланцюжка ділянок і цехів промислового підприємства. Як критерій оптимальності розглядається виконання багатостадійного розкладу в найкоротшітерміни. Запропоновано методи розрахунку нижньої межі довжини оптимального розкладу і евристичні алгоритми отримання наближених розв’язків, що потребують невеликих обсягів обчислень. Запропоновані алгоритми ілюструються числовими прикладами.

Keywords

task execution sequences; multistage schedules; minimum time; heuristic algorithm; lower bound on the value of the optimality criterion, последовательности выполнения заданий; многостадийные расписания; минимальное время; эвристический алгоритм; нижняя граница значения критерия оптимальности, послідовності виконання завдань; багатостадійні розклади; мінімальний час; евристичний алгоритм; нижня межа значення критерію оптимальності

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
gold
Related to Research communities