An Integrated Heuristic for Machine Sequencing With Specific Reference to the Permutation Flow-Shop Scheduling Problem
2019 ◽
Vol 2
(2)
◽
pp. 1-8
Keyword(s):
This article presents an integrated heuristic for the permutation flow-shop scheduling problem with the makespan criterion as one of the most widely studied classical sequencing problems in operations management. The proposed method consists of two phases: arranging the jobs in a priority order and then constructing a sequence by a job insertion principle. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the proposed heuristic. It is shown that the developed method gives a significantly improved performance for a wide range of standard problems of varying sizes.
2014 ◽
Vol 77
◽
pp. 35-47
◽
2013 ◽
Vol 10
(3)
◽
pp. 708-713
◽
2021 ◽
Vol 18
(4)
◽
pp. 545
2021 ◽
Vol 2010
(1)
◽
pp. 012018