Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time

- Flexible flow shop scheduling problem with robotic transportation is presented.
- Minimization of maximum completion time of all parts is considered as objective function.
- A mixed integer linear programming model is proposed for the problem.
- Two meta-heuristic algorithm, GA and ACO, is presented.