Szczegóły publikacji
Opis bibliograficzny
Using reversibility property to solve permutation flow shop scheduling problem by means of algorithms implementing N-list technique / Radosław PUKA, Bartosz ŁAMASZ // W: CLC 2022 [Dokument elektroniczny] : 10th Carpathian Logistics Congress : logistics, distribution, transport & management : Jun 15 - 17, 2022, Bojnice, Slovakia : conference proceedings. — Wersja do Windows. — Dane tekstowe. — Ostrava : TANGER Ltd., cop. 2022. — (CLC... (Conference Proceedings...) ; ISSN 2694-9318). — e-ISBN: 978-80-88365-08-2. — S. 234–239. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://www.confer.cz/proceedings/clc/2022.pdf [2022-12-05]. — Bibliogr. s. 239, Abstr.
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 144027 |
|---|---|
| Data dodania do BaDAP | 2022-12-21 |
| DOI | 10.37904/clc.2022.4540 |
| Rok publikacji | 2022 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Czasopismo/seria | CLC... (Conference Proceedings...) |
Abstract
One of the most popular algorithms for solving the permutation flow shop scheduling problem (PFSP) for the makespan minimization criterion is the NEH algorithm. Many research papers have been devoted to the NEH algorithm and its improvements. One of the most interesting improvements is the N-list technique, which can be implemented to other algorithms based on the NEH algorithm. This paper is devoted to analyzing the effect of the reversibility property on the results obtained by the selected algorithms. The analyses were performed on three example algorithms for which the N-list technique was implemented and which used the reversibility property. The analyses were performed using the two most popular benchmarks for the PFSP problem: the Taillard’s benchmark and the VRF benchmark. The results clearly indicate that the use of the reversibility property can significantly improve the results obtained by the algorithm.
