Алгоритми наближеного розв’язання багатостадійних Flow-Shop-Problem
The construction of multi-stage schedules for performing tasks on machines located in a sequential chain has many practical applications in discrete-production scheduling. Estimates are obtained for the lower bound of the performance criterion for the optimal sequence of tasks and 2 algorithms for a...
Gespeichert in:
| Datum: | 2019 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | Russisch |
| Veröffentlicht: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2019
|
| Schlagworte: | |
| Online Zugang: | http://journal.iasa.kpi.ua/article/view/184652 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | System research and information technologies |
Institution
System research and information technologies| Zusammenfassung: | The construction of multi-stage schedules for performing tasks on machines located in a sequential chain has many practical applications in discrete-production scheduling. Estimates are obtained for the lower bound of the performance criterion for the optimal sequence of tasks and 2 algorithms for approximate problem solving, ensuring that all work is performed at all stages of processing in the shortest possible time. The algorithms of the solution are illustrated by a numerical example. The estimates of the complexity of the proposed algorithms are given. The given algorithms for solving the problem can be used in the scheduling of the small- and medium-sized discrete production. |
|---|