Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
A noncooperative game model is established for the job shop scheduling problem of minimizing total weighted tardiness. Fictitious play is used to compute the Nash-equilibrium (NE). Then by exploiting the equivalence of the NE of the proposed game model and the optimal solutions of the Lagrangian dual problem and its linear programming dual problem, $\\alpha$-point idea is applied to
construct feasible schedules. Furthermore a simple local search method is designed to further improve the schedule performance. Numerical results on classical benchmark instances demonstrate the effectiveness of the proposed algorithm.
Keywords:job shop;noncooperative game;Lagrangian relaxation;fictitious play