A DE-LS Metaheuristic Algorithm for Hybrid Flow-Shop Scheduling Problem considering Multiple Requirements of Customers
Algorithm 1
The pseudocode of the correction strategy.
Initialization: the solution x, the number of jobs J, the lower-bound of the solution Lower, the upper-bound of the solution Upper, the list of customers’ requirements CR, procedures count list count.
(1)
While then
(2)
if or then
(3)
(4)
End if
(5)
(6)
(7)
End while
(8)
While then
(9)
(10)
(11)
End while
(12)
The following processes is used to correct the limitation of customers’ requirements
