Deterministic Method for Input Sequence Modification in NEH-Based Algorithms

Scheduling of production jobs falls into the area of planning, which, according to Henri Fayol's conception, is one of the basic functions of management. The permutation flow-shop scheduling problem (PFSP) with makespan criterion is one of the most studied scheduling problems in the area of sch...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 12; s. 68940 - 68953
Hlavní autori:	Puka, Radoslaw, Skalna, Iwona, Lamasz, Bartosz, Duda, Jerzy, Stawowy, Adam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Benchmark testing Complexity Complexity theory Criteria Heuristic algorithms Heuristics Job shop scheduling makespan N-list technique NEH permutation flow-shop scheduling problem Permutations Polynomials Production scheduling Scheduling Statistics Time complexity ToM method Turning
ISSN:	2169-3536, 2169-3536
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!