A scheduling in flexible flowshop problem with unrelated ：在无关的柔性流水作业问题的调度.pptVIP

Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria Agenda PROBLEM DESCRIPTION DETERMINATION OF INITIAL SOLUTION Constructive Algorithms Polynomial Improvement Heuristics METAHEURISTIC ALGORITHMS COMPUTATIONAL RESULTS CONCLUSIONS PROBLEM DESCRIPTION Flexible flow shop scheduling (FFS): n independent jobs; j ? {1, 2, ..., n} k stages; t ? {1, 2, ..., k} mt unrelated parallel machines; i ? {1, 2, ..., mt} STATEMENT OF THE PROBLEM Fixed standard processing time Fixed relative speed of machine processing time PROBLEM DESC