Revision as of 08:54, 18 October 2015 edit 91.67.175.24 (talk) →Minimizing makespan,Cmax ← Previous edit		Revision as of 08:44, 3 November 2015 edit undo Qx2020 (talk \| contribs) 205 edits m →Solution Methods: minor Next edit →
Line 14: ==Solution Methods== The proposed methods to solve flow shop scheduling problems can be classified toas [[exact ~~methods~~algorithm]] such as [[Branch and Bound]] and [[~~dynamic~~Heuristic ~~programming~~algorithm]], ~~[[Heuristic~~such ~~algorithms]] and~~as [[~~metaheuristics~~genetic algorithm]]. === Minimizing makespan,C<sub>max</sub> === F2\|prmu\|C<sub>max</sub> and F3\|prmu\|C<sub>max</sub> can be solved optimally by using Johnson's Rule (1954) but for general case there is no algorithm that guarantee the optimality of the solution.<br>

Flow-shop scheduling: Difference between revisions