Revision as of 21:32, 8 December 2018 edit Moras21 (talk \| contribs) 10 edits →Other objectives ← Previous edit		Revision as of 21:33, 8 December 2018 edit undo Moras21 (talk \| contribs) 10 edits →Other objectives Next edit →
Line 42: The algorithm is optimal. The detailed discussion of the available solution methods are provided by Malakooti (2013), see [{Malakooti]} for more detail. ==Footnotes==

Flow-shop scheduling: Difference between revisions