Abstract
Job-shop scheduling is usually a strongly NP-hard problem of combinatorial optimization problems and is one of the most typical production scheduling problem. It is usually very hard to find its optimal solution. In this paper, a new hybrid approach in dealing with this job-shop scheduling problem based on artificial neural network and genetic algorithm (GA) is presented. The GA is used for optimization of sequence and neural network (NN) is used for optimization of operation start times with a fixed sequence. New type of neurons which can represent processing restrictions and resolve constraint conflict are defined to construct a constraint neural network (CNN). CNN with a gradient search algorithm is applied to the optimization of operation start times with a fixed processing sequence. Computer simulations have shown that the proposed hybrid approach is of high speed and efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
