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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 12; pp. 68940 - 68953
Main Authors:	Puka, Radoslaw, Skalna, Iwona, Lamasz, Bartosz, Duda, Jerzy, Stawowy, Adam
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!