Revision as of 23:25, 23 August 2015 edit 128.237.145.249 (talk) →External links ← Previous edit		Revision as of 08:53, 18 October 2015 edit undo 91.67.175.24 (talk) →Complexity of flow shop scheduling Next edit →
Line 11: detailed discussion of performance measurement can be found in Malakooti (2013). ==Complexity of flow shop scheduling== As presented by Garey et al. (1976), most of extensions of the flow shop scheduling problems are NpNP-Hard and few of them can be solved optimally in O(nlogn), for example F2\|prmu\|C<sub>max</sub> can be solved optimally by using [[Johnson's Rule]]. ==Solution Methods==

Flow-shop scheduling: Difference between revisions