Research Article
Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
| Input: the initial sequence | | , | | while {the stopping criterion not satisfied} do | | Choose from the neighborhood of | | if then | | | | if then | | | | end if | | else | | if then | | | | end if | | end if | | end while | | Output: |
|