scholarly journals A better heuristic approach for n-job m-machine flow shop scheduling problem

10.26524/cm71 ◽  
2020 ◽  
Vol 4 (1) ◽  
Author(s):  
Vasudevan G ◽  
Jayakumar Dr ◽  
Sathiya shanthi R

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.

2013 ◽  
Vol 315 ◽  
pp. 385-388 ◽  
Author(s):  
Ho Yoong Chow ◽  
Sulaiman Hasan ◽  
Salleh Ahmad Bareduan

Flow shop scheduling is a common operational problem in a production system. Effective flow shop scheduling can help the company to improve the management system, hence increase income. Artificial Bee Colony (ABC) is a system that is widely used for scheduling optimization in a production system since 2005. However, the fundamental ABC system uses a heuristic approach to obtain an optimum solution which may not be the optimum solution at all. The ABC system is tested on the speed to obtain the optimum solution for a flowshop scheduling problem and measures the applicability of the schedule in terms of makespan. A simple model of ABC algorithm was developed to identify the effectiveness of the ABC for solving flow shop scheduling problem compared to other established methods. Result shows the ABC model is capable of producing best makespan in flow shop problem tested.


Sign in / Sign up

Export Citation Format

Share Document