An Enhanced Two-Level Metaheuristic Algorithm with Adaptive Hybrid Neighborhood Structures for the Job-Shop Scheduling Problem

Table 1

Transformation from C_i (t) into the LOSAP’s input-parameter values.

MUPLA’s Ci (t)	LOSAP’s input-parameter values
c1i (t) ∈ ℝ	PTBT =
c2i (t) ∈ ℝ	SD =
c3i (t) ∈ ℝ	PNO ≡ (NO1, NO2) =
c4i (t) ∈ ℝ	PROB =
pi (t) ∈ all possible operation-based permutations	P = pi (t)