PLANNING VESSEL BODY SECTION PRODUCTION
A problem of planning production of a vessel body section is considered. The problem is reduced to the classic Johnson’s tree-machine flow-shop scheduling problem. A genetic algorithm and computer experiment to compare efficiency of this algorithm and the algorithm of full enumeration are described....
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-11-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/179 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832543132832497664 |
|---|---|
| author | A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov |
| author_facet | A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov |
| author_sort | A. G. Grivachevsky |
| collection | DOAJ |
| description | A problem of planning production of a vessel body section is considered. The problem is reduced to the classic Johnson’s tree-machine flow-shop scheduling problem. A genetic algorithm and computer experiment to compare efficiency of this algorithm and the algorithm of full enumeration are described. |
| format | Article |
| id | doaj-art-0f415b9338c94077b762baef8a32f038 |
| institution | Kabale University |
| issn | 1816-0301 |
| language | Russian |
| publishDate | 2016-11-01 |
| publisher | National Academy of Sciences of Belarus, the United Institute of Informatics Problems |
| record_format | Article |
| series | Informatika |
| spelling | doaj-art-0f415b9338c94077b762baef8a32f0382025-02-03T11:51:50ZrusNational Academy of Sciences of Belarus, the United Institute of Informatics ProblemsInformatika1816-03012016-11-01044956178PLANNING VESSEL BODY SECTION PRODUCTIONA. G. Grivachevsky0V. D. Grivachevsky1M. Y. Kovalyov2A. I. Suhomlinov3Объединенный институт проблем информатики НАН БеларусиДальневосточный федеральный университетОбъединенный институт проблем информатики НАН БеларусиДальневосточный федеральный университетA problem of planning production of a vessel body section is considered. The problem is reduced to the classic Johnson’s tree-machine flow-shop scheduling problem. A genetic algorithm and computer experiment to compare efficiency of this algorithm and the algorithm of full enumeration are described.https://inf.grid.by/jour/article/view/179 |
| spellingShingle | A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov PLANNING VESSEL BODY SECTION PRODUCTION Informatika |
| title | PLANNING VESSEL BODY SECTION PRODUCTION |
| title_full | PLANNING VESSEL BODY SECTION PRODUCTION |
| title_fullStr | PLANNING VESSEL BODY SECTION PRODUCTION |
| title_full_unstemmed | PLANNING VESSEL BODY SECTION PRODUCTION |
| title_short | PLANNING VESSEL BODY SECTION PRODUCTION |
| title_sort | planning vessel body section production |
| url | https://inf.grid.by/jour/article/view/179 |
| work_keys_str_mv | AT aggrivachevsky planningvesselbodysectionproduction AT vdgrivachevsky planningvesselbodysectionproduction AT mykovalyov planningvesselbodysectionproduction AT aisuhomlinov planningvesselbodysectionproduction |