Research Article
Production Scheduling and Customer Orders Assignment in a Three-Level Supply Chain
Algorithm 1
The sod code of variable neighborhood search algorithm.
| Procedure: Variable Neighborhood Search Algorithm | | Initialization: select a set of neighborhood structures () | | Find an initial solution () | | While stopping criterion is not met (maximum allowed CPU time) | | set | | If () | | = generate a new solution from the th neighborhood of | | If tardiness() ≤ tardiness() | | | | End if | | continue the search with | | Else | | | | End if | | End while | | Report as the best solution |
|
