PLANNING VESSEL BODY SECTION PRODUCTION
Abstract
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.
About the Authors
A. G. Grivachevsky
Объединенный институт проблем информатики НАН Беларуси
Беларусь
Беларусь
V. D. Grivachevsky
Дальневосточный федеральный университет
Россия
Россия
M. Y. Kovalyov
Объединенный институт проблем информатики НАН Беларуси
Беларусь
Беларусь
A. I. Suhomlinov
Дальневосточный федеральный университет
Россия
Россия
References
1. Johnson, S.M. Optimal two- and three-stage production schedules with set-up time included / S.M. Johnson // Naval Research Logistics Quarterly. – 1954. – Vol. 1. – P. 61–68.
2. Гэри, М. Вычислительные машины и труднорешаемые задачи / М. Гэри, Д. Джонсон. – М. : Наука, 1979.
3. Holland, J. Adaptation in natural and artificial systems / J. Holland. – Cambridge : MIT Press, 1992.
4. Xu, X. Computer-aided process planning – A critical review of recent developments and future trends / X. Xu, L. Wang, S.T. Newman // International Journal of Computer Integrated Manufacturing. – 2011. – Vol. 24, № 1. – P. 1–31.
5. Qassim, R.Y. Integrated process planning and scheduling and multimode resource constrained project scheduling: ship block assembly application / R.Y. Qassim // Manufacturing System. – 2012. – P. 307–314.
Review
For citations:
Grivachevsky A.G., Grivachevsky V.D., Kovalyov M.Y., Suhomlinov A.I. PLANNING VESSEL BODY SECTION PRODUCTION. Informatics. 2015;(4):49-56. (In Russ.)
Views:
1051
JATS XML
Email this article 