IDEAS home Printed from https://ideas.repec.org/a/scn/009530/14508850.html
   My bibliography  Save this article

Построение Расписаний Выполнения Заданий Для Параллельно Работающих Систем Машин И Поточных Линий

Author

Listed:
  • Зак Юрий Александрович

    (г. Аахен, Германия)

Abstract

В развитие Flow-Shop-Problem рассмотрены постановки и математическая модель задачи построения расписаний для параллельно работающих систем машин в условиях заданной системы ограничений на сроки выполнения заданий. Исследованы свойства допустимых и оптимальных расписаний и предложены методы решения задачи с помощью последовательных алгоритмов оптимизации. Приведены числовые примеры.The development of Flow-Shop-Problem is considered. The mathematical model of scheduling for parallel working systems of machines under a given set of constraints on deadlines for separate tasks is considered. The properties of admissible and optimal schedules are examined and the methods of optimal scheduling by sequential optimization algorithms are proposed. The presented example shows the efficiency of the developed algorithms.

Suggested Citation

  • Зак Юрий Александрович, 2013. "Построение Расписаний Выполнения Заданий Для Параллельно Работающих Систем Машин И Поточных Линий," Проблемы управления, CyberLeninka;Общество с ограниченной ответственностью "СенСиДат-Контрол", issue 6, pages 62-70.
    • Handle: RePEc:scn:009530:14508850
    as

    Download full text from publisher

    File URL: http://cyberleninka.ru/article/n/postroenie-raspisaniy-vypolneniya-zadaniy-dlya-parallelno-rabotayuschih-sistem-mashin-i-potochnyh-liniy
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:scn:009530:14508850. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CyberLeninka (email available below). General contact details of provider: http://cyberleninka.ru/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.