A RESULT ON THE QUASI-PHYSICS AND QUASI-HUMAN ALGORITHM FOR SOLVING THE JOB SHOP SCHEDULING PROBLEM

摘要：

The job shop scheduling problem with minimizing make-span is discussed. A basic quasi-physics and quasi-human algorithm (BQ&Q) that is a new method for the problem is proposed. The algorithm is based on an elastic model of the problem and the schedule is created by the strategy of quasi-physics and quasi-human. A theorem about the feasibility of BQ&Q is proved, which guarantees that BQ&Q can be used as a very useful basic procedure to design much more effective and efficient heuristic algorithm for the problem.

关键词： Job Shop Scheduling Problem NP hard Quasi-Physics Quasi-Human

作者: AI-HUA YIN SHOU-SHENG ZHANG

作者单位: UFIDA software school of Jiangxi University of Finance and Economics.Nanchang, Jiangxi 330013, P.R.C Information &Technology school of Jiangxi University of Finance and Economics Nanchang, Jiangxi 3300

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 889-893

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）