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: |
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 |
| Summary: | 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. |
|---|---|
| ISSN: | 1816-0301 |