Szczegóły publikacji

Opis bibliograficzny

Impact of input sequence on N-NEH+ algorithm / 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. 191–196. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://www.confer.cz/proceedings/clc/2022.pdf [2022-12-05]. — Bibliogr. s. 195–196, Abstr.

Autorzy (2)

Słowa kluczowe

N-list techniqueN-NEH+ algorithmPFSPinput sequencescheduling

Dane bibliometryczne

ID BaDAP144024
Data dodania do BaDAP2022-12-21
DOI10.37904/clc.2022.4556
Rok publikacji2022
Typ publikacjimateriały konferencyjne (aut.)
Otwarty dostęptak
Czasopismo/seriaCLC... (Conference Proceedings...)

Abstract

The job scheduling problem is one of the biggest optimization challenges for manufacturing companies. A properly performed planning can reduce both cost and production time. A scheduling problem that has been the subject of research in numerous research papers is the permutation flow shop scheduling problem (PFSP) with makespan as optimization (minimization) criterion. Frequently used algorithms to solve PFSP is the constructive deterministic heuristic algorithm NEH. Many researchers have analyzed the effectiveness of the NEH algorithm. An example of the issues studied is the importance of the order of input data on the results obtained by the NEH algorithm. In the literature, a number of variants of NEH-based algorithms can be found. The N-NEH+ algorithm is considered to be one of the most efficient. Therefore, this paper focuses on analyzing the influence of the input sequence on the results obtained by the N-NEH+ algorithm. Two most popular benchmarks were used to analyze the influence of the input sequence: the Taillard's benchmark and the VRF benchmark. The results obtained confirm that the input sequence has a significant impact on the results obtained by the N-NEH+ algorithm. However, this influence is less than that of the NEH algorithm.

Publikacje, które mogą Cię zainteresować

fragment książki
#144027Data dodania: 21.12.2022
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.
artykuł
#140289Data dodania: 7.2.2023
Input sequence of jobs on NEH algorithm for permutation flowshop scheduling problem / Radosław PUKA, Jerzy DUDA, Adam STAWOWY // Management and Production Engineering Review ; ISSN 2080-8208. — 2022 — vol. 13 no. 1, s.32–43. — Bibliogr. s. 42–43, Abstr.