期刊文献+

Feature-based initial population generation for the optimization of job shop problems

Feature-based initial population generation for the optimization of job shop problems
原文传递
导出
摘要 A suitable initial value of a good(close to the optimal value) scheduling algorithm may greatly speed up the convergence rate.However,the initial population of current scheduling algorithms is randomly determined.Similar scheduling instances in the production process are not reused rationally.For this reason,we propose a method to generate the initial population of job shop problems.The scheduling model includes static and dynamic knowledge to generate the initial population of the genetic algorithm.The knowledge reflects scheduling constraints and priority rules.A scheduling strategy is implemented by matching and combining the two categories of scheduling knowledge,while the experience of dispatchers is externalized to semantic features.Feature similarity based knowledge matching is utilized to acquire the constraints that are in turn used to optimize the scheduling process.Results show that the proposed approach is feasible and effective for the job shop optimization problem. A suitable initial value of a good (close to the optimal value) scheduling algorithm may greatly speed up the convergence rate. However, the initial population of current scheduling algorithms is randomly determined. Similar scheduling instances in the production process are not reused rationally. For this reason, we propose a method to generate the initial population of job shop problems. The scheduling model includes static and dynamic knowledge to generate the initial population of the genetic algorithm. The knowledge reflects scheduling constraints and priority rules. A scheduling strategy is implemented by matching and combining the two categories of scheduling knowledge, while the experience of dispatchers is externalized to semantic features. Feature similarity based knowledge matching is utilized to acquire the constraints that are in turn used to optimize the scheduling process. Results show that the proposed approach is feasible and effective for the job shop optimization problem.
出处 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2010年第10期767-777,共11页 浙江大学学报C辑(计算机与电子(英文版)
基金 supported by the Important National Science and Technology Specific Projects (No 2009ZX04014-031) the Science and Technology Pillar Program of Zhejiang Province (No 2009C31120) the Zhejiang Provincial Natural Science Foundation of China (NoZ1080339)
关键词 Scheduling feature Job shop problem(JSP) Scheduling optimization Scheduling knowledge Scheduling feature, Job shop problem (JSP), Scheduling optimization, Scheduling knowledge
  • 相关文献

参考文献1

二级参考文献12

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:110
  • 2GAREY M R, JOHNSON D S. Computers and intractability: a guide to the theory of NP-completeness [M]. San Francisco: Freeman, 1979.
  • 3HOLAND J H. Adaptation in natural and artificial systems [M]. Ann Arbor: The University of Michigan Press, 1975.
  • 4GEN M, TSUJIMURA Y, KUBOTA E. Solving job-shop scheduling problems using genetic algorithm[C] // Proc. of the 16th Int. Conf. on Computer and Industrial Engineering, Ashikaga, Japan, 1994: 576-579.
  • 5CHENG R, GEN M, TSUJIMURA Y. A tutorial survey of job-shop scheduling problems using genetic algorithms-Ⅰ, representation[J]. Computers & Industrial Engineering, 1996, 30(4): 983-997.
  • 6BIERWIRTH C. A generalized permutation approach to job shop scheduling with genetic algorithms[J]. OR Spektrum, 1995, 17: 87-92.
  • 7Baker K R. Introduction to sequencing and scheduling [M]. NewYork: Wisely, 1974.
  • 8PINEDO M. Scheduling theory, algorithms, and system [M]. 2nd ed. New Jersey: Prentice Hall, Upper Saddle River, 2002.
  • 9CHENG R, GEN M, TSUJIMURA Y. A tutorial survey of job shop scheduling problems using genetic algorithms part Ⅱ: hybrid genetic search strategies[J]. Computers and Industrial Engineering, 1999, 36: 343-364.
  • 10SHI G Y, IIMA H, SANNOMIYA N. A new encoding scheme for job shop problems by genetic algorithm[C] //Proceedings of the 35th Conference on Decision and Control, Kobe, Japan, 1996, 4395-4400.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部