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

Свойства Допустимых И Оптимальных Последовательностей Выполнения Работ На Одной Машине

Author

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

Abstract

Рассмотрены свойства допустимых и оптимальных последовательностей выполнения заданий на одной машине в условиях наличия ограничений на сроки начала и завершения выполнения работ. Предложены методы решения сформулированной задачи последовательными алгоритмами оптимизации на основе преобразования расписания, допускающего разрывы в выполнении работ в оптимальную последовательность, в которой такие разрывы не допускаются. Приведены числовые примеры.Properties of admissible and optimum sequences of performance of tasks by one machine unser restrictions on terms of the beginning and completion of works are considered. Methods of the formulated problem solution by consecutive algorithms of optimization are offered. The schedules supposing ruptures in performance of works are transformed to optimum sequence in which such ruptures are not supposed. The offered algorithms are illustrated by numerical examples and can successfully be applied to solution of these problems under no restrictions.

Suggested Citation

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

    Download full text from publisher

    File URL: http://cyberleninka.ru/article/n/svoystva-dopustimyh-i-optimalnyh-posledovatelnostey-vypolneniya-rabot-na-odnoy-mashine
    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:14050861. 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.