Research Article
ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness
| output: Best solution | | () begin | | () CONSTRUCTION(); | | () ≔ LOCAL_SEARCH(, , ); | | () ; | | () ; | | () ; //the best solution | | () ; | | () while stop_condition do | | () ≔ PERTURBATION(, ); | | () ≔ LOCAL_SEARCH(, , ); | | () ≔ Randomly select a solution from ; | | () ≔ PATH_RELINKING(, ); | | () ≔ UPDATE_ELITE_SET(, ); | | () if then | | () ; | | () ; | | () ; | | () else | | () ; | | () if then | | () ; | | () if then | | () ; | | () else | | () ≔ ACCEPTANCE_CRITERION(, , ); | | () return |
|