Introduction - If you have any usage issues, please Google them yourself
Flow-shop scheduling problem requires to determine that the optimal n-job processing sequence, so the first job from start processing on the machine, to the last job on the machine processing time required to complete a minimum.