Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

Algorithm 1

Overall operational structure of local search.

(1) Get initial solution 𝑥^′, 𝑑𝑟, and 𝑠.

(2) Set 𝑞←0 and 𝑢←0.

(3) While 𝑞<𝑞_max do

  (a) 𝑥^′′← the best one among the 𝑠 candidates from 𝑁_𝑢(𝑥^′).

  (b) If 𝑓(𝑥^′′)−𝑓(𝑥^′)≤𝑑𝑟 then 𝑥^′←𝑥^′′;

     else 𝑢←|𝑢−1|.

  (c) 𝑞←𝑞+1.

(4) 𝑥^′′←𝑥^′.