并行多机开放车间调度问题的模型与算法  

Model and Algorithm of Paravlel Multiprocessor Open Shop Scheduling Problem

作　　者：陈亚绒[1] 黄佩钰 李沛[1] 周富得 黄沈权[1] CHEN Yarong;HUANG Peiyu;LI Pei;CHOU Fuhder;HUANG Shengquan(College of Mechanical and Electronic Engineering,Wenzhou University,Wenzhou,Zhejiang,325035)

机构地区：[1]温州大学机电工程学院,温州325035

出　　处：《中国机械工程》2018年第22期2666-2673,2681,共9页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(51705370;71501143);浙江省自然科学基金资助项目(LY18G010012;LY19G010007);温州市公益性科技计划资助项目(G20170006)

摘　　要：发光二极管制造过程中,晶粒分类拣选工序的调度问题是典型的并行多机开放车间调度问题,属于NP-hard问题。研究了该调度问题以最小化总加权完工时间为目标的求解模型与算法。根据问题特性构建了可获得最优解的混合整数规划模型,并设计了同时考虑质量与求解效率的启发式算法和改进粒子群优化算法。仿真结果显示,启发式算法和改进粒子群优化算法都能在合理的时间内迅速有效地获得较佳的调度解。Grain sorting scheduling problem in LED manufacturing was a typical multiprocessor open shop scheduling problem,which belonged to NP-hard problem.Model and algorithm for solving this kind of scheduling problems with the objective of minimizing total weighted completion time were studied herein.According to the characteristics of the problem,a mixed integer-programming model was constructed to obtain the optimal solution,and a heuristic algorithm and an improved particle swarm optimization algorithm were designed.Simulation results show that both heuristic algorithm and improved particle swarm optimization algorithm may obtain good scheduling solutions quickly and effectively in a reasonable time.

关 键 词：开放车间调度问题 发光二极管 加权完工时间 改进粒子群优化算法 晶粒分类拣选 

分 类 号：F224[经济管理—国民经济]