A better heuristic approach for n-job m-machine flow shop scheduling problem
Keyword(s):
Scheduling problem has its origin in manufacturing industry.In this paper we describe a simple approach for solving the flow shop scheduling problem. The result we obtained has been compared with Palmers Heuristic and CDS algorithms along with NEH. It was found that our method will reach near optimum solution within few steps compared to CDS and NEHalgorithm and yield better result compared to Palmers Heuristic with objective of minimizing the Makespan for the horizontal rectangular matrix problems.
2005 ◽
Vol 10
(2)
◽
pp. 301-305
◽
Keyword(s):
2006 ◽
Vol 99
(1-2)
◽
pp. 4-15
◽
Keyword(s):
2000 ◽
Vol 64
(1-3)
◽
pp. 143-152
◽
2013 ◽
Vol 315
◽
pp. 385-388
◽
1989 ◽
Vol 40
(4)
◽
pp. 395-399
◽
Keyword(s):