Abstract

In this paper, neural networks (NN) are implemented to manipulate a problem of machine scheduling for a single machine to minimize multicriteria objective function: maximum tardiness, maximum late work and total late work simultaneously (Tmax, Vmax, ΣVj). Also the results of applying NN are compared with some exact methods, some heuristic methods and local search methods [7,14]. The used NN is learned by pack propagation algorithm for n = 3: 500 jobs. NN technique was be found to be effective and used to select the best efficient and optimal schedule which minimizes the objective function.

Full Text
Paper version not known

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 call

Disclaimer: 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.