Research Article
A Study of Flexible Flow Shop Scheduling Problem with Various Heterogeneous Labors
| (1) | Procedure ACO | | (2) | Select an initial point | | | Iteration t = 1 | | | Spread pheromones for the first iteration | | (3) | Do until reaching the stopping criteria | | (4) | For each ant | | (5) | For each job | | (6) | If job ≠1 then evaluate the initial point end if | | (7) | Load possible ending points in the last day for job j | | (8) | Generate the graph for the problem | | (9) | For each condition of dispatching rule | | (10) | Computes the visibility for each possible move | | (11) | Draw the next job to be processed considering the probabilities. | | (12) | Updated the sparse graphs | | (13) | Next condition of dispatching rule | | (14) | Next job | | (15) | Apply the local search procedure | | (16) | Save the solution if it is the best one | | (17) | Computes the quantity of pheromones to be spread by the ant i in each arc, job and day. | | (18) | Next ant | | (19) | update the pheromones using the variation and t = t + 1 | | (20) | Loop | | (21) | Return the best solution found |
|
