The US National Science Foundation (No. CMMI-0408390, CMMI-0644552);the Research Fellowship for International Young Scientists (No. 51050110143);the Fok Ying-Tong Education Foundation(No. 114024);the Natural Science Foundation of Jiangsu Province (No.BK2009015);the Postdoctoral Science Foundation of Jiangsu Province (No.0901005C)
To diagnose the feasibility of the solution of a job-shop scheduling problem(JSSP),a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algori...