This paper deals with permutation flowshop scheduling to minimize makespan. Some novel useful definitions and properties are established. Then, the paper proposes novel solution methods. Particular attention is paid to algorithms based on the orderings of pairs of jobs. The first algorithm is for three-machine problems and gives optimal solution in a certain strict sense in the case of the ordering of two jobs. Moreover, the paper extends the three-machine Johnson’s rule to the general case of m-machine problems.
Aminnayeri, M., & Naderi, B. (2016). Novel properties along with solution methods for permutation flowshop scheduling. Scientia Iranica, 23(5), 2261-2276. https://doi.org/10.24200/sci.2016.3955
MLA
Aminnayeri, M., & Naderi, B. "Novel properties along with solution methods for permutation flowshop scheduling", Scientia Iranica, 23, 5, 2016, 2261-2276. doi: 10.24200/sci.2016.3955
HARVARD
Aminnayeri M., Naderi B. (2016). 'Novel properties along with solution methods for permutation flowshop scheduling', Scientia Iranica, 23(5), pp. 2261-2276. doi: 10.24200/sci.2016.3955
CHICAGO
M. Aminnayeri & B. Naderi, "Novel properties along with solution methods for permutation flowshop scheduling," Scientia Iranica, 23 5 (2016): 2261-2276, doi: 10.24200/sci.2016.3955
VANCOUVER
Aminnayeri M., Naderi B. Novel properties along with solution methods for permutation flowshop scheduling. Scientia Iranica. 2016;23(5):2261-2276. doi: 10.24200/sci.2016.3955
