Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling

- We build a novel model of the developed distributing scheduling by supplementing the reentrant characteristic into the model of distributed reentrant permutation flow shop scheduling (DRPFS).
- We determine the number of factory needs to use, factory assignment and sequence of job assigned to the factory.
- A novel multi-objective adaptive large neighborhood search (MOALNS) algorithm is developed.
- The various destroy and repair operators are presented.