节点文献

多色粒子群的作业车间调度研究

Research for Job Shop Scheduling Problem of Polychromatic Particle Swarm Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 房亚东王芳

【Author】 FANG Ya-dong;WANG Fang;The Institute of Mechanical and Electrical Engineer,Xi’an Technological University;

【机构】 西安工业大学机电工程学院

【摘要】 为了对车间的资源配置和作业调度这两个问题进行综合考虑,提出了一种基于多色粒子群的作业车间调度方法。首先根据各个作业的要求,对车间的设备资源进行配置。针对车间设备资源管理和配置的特点,应用多色集合和多色图,建立资源关联图模型。并运用多色集合的围道矩阵和推理运算规则,对作业任务需要的加工设备进行分配,推导出工序集所有可行的资源配置集合;然后根据粒子群算法的原理和特点解决作业车间调度问题,以最大完工时间最小为优化目标,结合基于工序的编码方式,构建了求解作业车间调度问题的方法,并通过实例验证了算法的收敛性及有效性。

【Abstract】 In order to consider two issues that resource allocation and job scheduling of the workshop,a job-shop scheduling method based on polychromatic particle swarm is introduced. First,according to the demand of task scheduling,the equipment resources of workshop are allocated. It uses polychromatic sets theory to establish the mode of equipment allocation for features management and configuration of workshop equipment resource. And using matrix and operation rules of polychromatic sets theory to separated tasks in need of processing and gain corresponding resource set; then according to the principles and characteristics of the particle swarm algorithm to solve the job shop scheduling problem,combining the optimization goal of minimum makespan with process-based encoding,it built the method of solving the job shop scheduling problem,verifying the convergence and effectiveness of the algorithm by an example.

【基金】 陕西省科学技术研究发展计划项目(2010K01-076);2012年陕西省教育厅科学研究计划项目(12JK0665)
  • 【文献出处】 机械设计与制造 ,Machinery Design & Manufacture , 编辑部邮箱 ,2013年11期
  • 【分类号】TH186
  • 【被引频次】2
  • 【下载频次】69
节点文献中: 

本文链接的文献网络图示:

本文的引文网络