A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Algorithm 3

Simulated Annealing.

(1)  Initialize to be the initial tour

(2) Set =

(3) Evaluate the fitness of =

(4) Set (the fitness of ) =

(5) Initiate starting temperature and final temperature

(6) while   ≥   do

   (6.1) for   to   do

     (6.1.1) = Determine_Solution()

     (6.1.2) = Determine_Fitness

     (6.1.3) if   better then   then

        (6.1.3.1) = true

     (6.1.4) else

        (6.1.4.1) Calculate acceptance probability

        (6.1.4.2) if   > random  then

             (6.1.4.2.1) = true

        (6.1.4.3) end if

     (6.1.5) end else

     (6.1.6) if    then

        (6.1.6.1) = false

        (6.1.6.2) =

        (6.1.6.3) =

        (6.1.6.4) if   better than   then

             (6.1.6.4.1) =

             (6.1.6.4.2) =

        (6.1.6.5) end if

     (6.1.7) end if

   (6.2) end for

   (6.3) Update according to cooling schedule

(7) end while

(8) return