A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem
Algorithm 1
The enhanced Best Performance Algorithm.
(1) Initialize variables = 0, = 0, = 0
(2)Set the size of the Performance List, that is,
(3)Set probability
(4)Set the first solution in the Performance List, that is,
(5)Calculate the fitness value of , that is,
(6)Set
(7)Set Boolean variable
(8)if not Stopping_Criterion_Met() then (e.g., for to do)
(8.1) if resize() then
(8.1.1) resize_PL()
(8.2) end if
(8.3) ifthen
(8.3.1) = Determine_Solution
(8.4) else
(8.4.1) = Determine_Solution
(8.4.2) = true
(8.5) end if
(8.6) = Determine_Fitness(
(8.7) if better than then
(8.7.1) perform_Update()
(8.8) end if
(8.9) if random then
(8.9.1) =
(8.10) end if
(9)end if (or e.g., end for)
(10) return
We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.
