Research Article
An Ant Optimization Model for Unrelated Parallel Machine Scheduling with Energy Consumption and Total Tardiness
Local Search Algorithm: | Set IterationNum = 1; | While (IterationNum < MaxIterationNum) | For each machine | For each job in machine | For each job () in machine | Construct new solution by exchanging two jobs | If the new solution is better than current one, then exchange two jobs | Find the machine with the highest objective value | Find the machine with the lowest objective value | For each in machine | For each in machine | Construct new solution by exchanging two jobs | If the new solution is better than current one, then exchange two jobs |
|