Planning Flow Shop Scheduling
Physical Sciences
Donatas Kavaliauskas
Vilnius University
Leonidas Sakalauskas
Šiauliai University
Published 2020-06-30
https://doi.org/10.21277/jmd.v50i1.280
PDF

Keywords

optimization
branch and bound algorithm
flow shop

How to Cite

Kavaliauskas D. and Sakalauskas L. (2020) “Planning Flow Shop Scheduling”, Jaunųjų mokslininkų darbai, 50(1), pp. 62-69. doi: 10.21277/jmd.v50i1.280.

Abstract

Various planning problems often arise in production design and management: planning of resources, raw materials, personnel. These problems fall into the complexity class of NP fullness. It is not enough to use greedy algorithms to get the optimal solution, heuristic algorithms must be used. One of heuristic algorithms is the branch and bound algorithm. This algorithm is a computer-simulated solution to the problem of flow shop. The paper presents several variants of the flow shop planning problem, for which the branch and bound algorithm has been adapted.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Most read articles by the same author(s)