Solving job-shop scheduling problem with priority using neural network
Based on an improved method of neural networks for a job-shop scheduling problem (JSP), a method for JSP with priority is described. Two other very important JSPs-the string problem and JSP with due dates-were transformed to JSP with priority using the proposed method. Simulations were successfully done; the method was found to be good and simple.<<ETX>>