Research Article
ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness
| output: Improved solution | | () begin | | () ; | | () while do | | () false; | | () set of jobs determined at random; | | () for to do | | () ≔ randomly select a job from ; | | () ; | | () if then | | () ≔ best solution obtained by inserting job in all position of ; | | () if then | | () ; | | () ≔ true; | | () if then | | () Go to step () / First Improvement / | | () return |
|