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....
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-11-01
|
Series: | Informatika |
Online Access: | https://inf.grid.by/jour/article/view/179 |
id |
doaj-0f415b9338c94077b762baef8a32f038 |
---|---|
record_format |
Article |
spelling |
doaj-0f415b9338c94077b762baef8a32f0382021-07-28T21:07:22ZrusThe United Institute of Informatics Problems of the National Academy of Sciences of Belarus Informatika1816-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 |
collection |
DOAJ |
language |
Russian |
format |
Article |
sources |
DOAJ |
author |
A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov |
spellingShingle |
A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov PLANNING VESSEL BODY SECTION PRODUCTION Informatika |
author_facet |
A. G. Grivachevsky V. D. Grivachevsky M. Y. Kovalyov A. I. Suhomlinov |
author_sort |
A. G. Grivachevsky |
title |
PLANNING VESSEL BODY SECTION PRODUCTION |
title_short |
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_sort |
planning vessel body section production |
publisher |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus |
series |
Informatika |
issn |
1816-0301 |
publishDate |
2016-11-01 |
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. |
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 |
_version_ |
1721262950304448512 |