N-NEH+ algorithm for solving permutation flow shop problems
Year of publication: |
2021
|
---|---|
Authors: | Puka, Radosław ; Duda, Jerzy ; Stawowy, Adam ; Skalna, Iwona |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 132.2021, p. 1-15
|
Subject: | N-list technique | N-NEH+ | Heuristics | Permutation flow shop | Heuristik | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control |
-
Chen, Zhen, (2020)
-
Trajectory scheduling methods for minimizing total tardiness in a flowshop
Li, Xiaoping, (2015)
-
Scheduling unrelated machines with job splitting, setup resources and sequence dependency
Avgerinos, Ioannis, (2023)
- More ...
-
Puka, Radosław, (2024)
-
Bertini, Cesarino, (2014)
-
WTI crude oil options market prior to and during the COVID-19 pandemic
Łamasz, Bartosz, (2023)
- More ...