- Tytuł:
- Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
- Autorzy:
-
Józefczyk, J.
Markowski, M.
Balgabaeva, L. - Powiązania:
- https://bibliotekanauki.pl/articles/406986.pdf
- Data publikacji:
- 2014
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
manufacturing systems
operations research
complex systems
optimization problems
scheduling algorithms
routing algorithms
heuristics
computer simulation - Opis:
- This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.
- Źródło:
-
Management and Production Engineering Review; 2014, 5, 4; 26-35
2080-8208
2082-1344 - Pojawia się w:
- Management and Production Engineering Review
- Dostawca treści:
- Biblioteka Nauki
Artykuł