A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems
2016
Applied and Computational Mathematics
Preserved Fulltext
Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.
doi:10.11648/j.acm.20160501.11
fatcat:hexxw5xjibfl3a4kepssgs4gh4