上海交通大学学报(自然版) ›› 2014, Vol. 48 ›› Issue (03): 382-387.

• 自动化技术、计算机技术 • 上一篇    下一篇

面向分段涂装作业的混合流水车间调度

张志英1,林晨1,杨连生1,2,薛士枚3,刘建峰2
  

  1. (1.同济大学 机械与能源工程学院,上海 201804;2.上海外高桥造船有限公司,上海 200137;3.上海江南长兴造船有限责任公司,上海 201913)
     
  • 收稿日期:2013-06-24
  • 基金资助:

    国家自然科学基金资助项目(70872076),上海科技创新行动计划资助项目(11dz1121803),江苏省南通市2010AA科技创新计划(工业)项目(AA2010048)

Block-Painting-Operation-Oriented Hybrid Flow Shop Scheduling

ZHANG Zhiying1,LIN Chen1,YANG Liansheng1, 2,XUE Shimei3,LIU Jianfeng2
  

  1. (1. School of Mechanical Engineering, Tongji University, Shanghai 201804, China; 2. Shanghai Waigaoqiao Shipbuilding Co. Ltd., Shanghai 200137, China;
    3. Shanghai Jiangnan Changxing Shipbuilding Co. Ltd., Shanghai 201913, China)
  • Received:2013-06-24

摘要:

基于船舶分段涂装作业,提炼出具有重入和等待时间约束的两阶段混合流水车间调度问题.其中第一阶段含多台批处理机,第二阶段含多台离散机且存在一次重入过程,两阶段间有等待时间约束.以最小化最大完工时间为优化目标建立数学模型,提出一种结合Metropolis抽样准则和变邻域搜索的混合量子粒子群优化算法,并利用多种启发式规则进行解码.实例验证和数值分析表明,所提算法是解决分段涂装调度问题的一种有效方法.
 
 

关键词: 分段涂装, 混合流水车间, 批离散, 量子粒子群

Abstract:

A two-stage hybrid flow shop scheduling problem with reentrant and limited waiting time constraints was presented based on block painting operations. The first stage contained several identical batching machines which were able to process multiple jobs simultaneously, and the second stage contained several identical discrete machines. Minimization of the makespan was used as the optimization objective to build a mathematical model. A hybrid quantumbehaved particle swarm optimization algorithm combined with Metropolis rule and variable neighborhood search was proposed. The heuristic decoding strategy was developed to generate the scheduling scheme. Application and numerical analysis indicated that the proposed algorithm was an effective solution to the problem of block painting scheduling.
 

Key words: block painting, hybrid flow shop, batchdiscrete, quantum particle swarm

中图分类号: