An artificial neural network based heuristic for flow shop scheduling problems

2009 ◽  
Vol 22 (2) ◽  
pp. 279-288 ◽  
Author(s):  
T. Radha Ramanan ◽  
R. Sridharan ◽  
Kulkarni Sarang Shashikant ◽  
A. Noorul Haq
Author(s):  
Harendra Kumar ◽  
Shailendra Giri

This paper considers a flow shop scheduling problems of n jobs on m machines involving processing times and weights of jobs with the major constraint as breakdown times of the machines. In this paper a new procedure is provided to obtain an optimal job sequence with the objective of minimize the makespan and mean weighted flow time by using neural network technique. To illustrate the proposed method procedure, a numerical example is given. The effectiveness of the proposed method is compared with many problems which are taken from different papers. This paper also provides a comparison of our proposed method with the existing methods in literature.


Sign in / Sign up

Export Citation Format

Share Document