[1]陈云云,张志英.船舶分段涂装作业重入调度优化算法[J].哈尔滨工程大学学报,2016,37(08):1103-1110.[doi:10.11990/jheu.201601002]
 CHEN Yunyun,ZHANG Zhiying.Optimization algorithm for reentrant scheduling in block painting operations[J].hebgcdxxb,2016,37(08):1103-1110.[doi:10.11990/jheu.201601002]
点击复制

船舶分段涂装作业重入调度优化算法(/HTML)
分享到:

《哈尔滨工程大学学报》[ISSN:1006-6977/CN:61-1281/TN]

卷:
37
期数:
2016年08期
页码:
1103-1110
栏目:
出版日期:
2016-08-25

文章信息/Info

Title:
Optimization algorithm for reentrant scheduling in block painting operations
作者:
陈云云 张志英
同济大学 机械与能源工程学院, 上海 201804
Author(s):
CHEN Yunyun ZHANG Zhiying
School of Mechanical Engineering, Tongji University, Shanghai 201804, China
关键词:
分段涂装涂装作业时间约束空间约束重入调度启发式算法聚类算法优化算法
分类号:
TP301.6
DOI:
10.11990/jheu.201601002
文献标志码:
A
摘要:
针对分段涂装过程中存在调度效率低、完工时间长等问题,本文将分段涂装作业抽象为带有时间和空间约束的批-离散机重入过程,以最小化最大完工时间为优化目标建立数学模型,构造了基于重排策略的启发式算法。通过聚类算法和基于模拟退火的组批重排策略获得不考虑空间约束的分段分批结果,利用最大接触策略实现分段的空间组批调度,提出基于最大剩余加工时间策略和遗传算法的超启发式算法进行分段的重入调度。仿真实验表明,所提出的算法可以充分利用冲砂车间的空间,得到较优的分段涂装调度计划。

参考文献/References:

[1] CHO K K, CHUNG K H, PARK C, et al. A spatial scheduling system for block painting process in shipbuilding[J]. CIRP annals-manufacturing technology, 2001, 50(1):339-342.
[2] KWON B, LEE G M. Spatial scheduling for large assembly blocks in shipbuilding[J]. Computers & industrial engineering, 2015, 89:203-212.
[3] 张志英, 林晨, 杨连生, 等. 面向分段涂装作业的混合流水车间调度[J]. 上海交通大学学报, 2014, 48(3):382-387, 393. ZHANG Zhiying, LIN Chen, YANG Liansheng, et al. Block-painting-operation-oriented hybrid flow shop scheduling[J]. Journal of Shanghai JiaoTong University, 2014, 48(3):382-387, 393.
[4] 林晨, 张志英. 考虑运输时间窗的批-离散混合流水车间调度[J]. 计算机集成制造系统, 2014, 21(9):2427-2434. LIN Chen, ZHANG Zhiying. Batch-discrete hybrid flow shop scheduling with transportation in time windows[J]. Computer integrated manufacturing systems, 2014, 21(9):2427-2434.
[5] SU L H. A hybrid two-stage flowshop with limited waiting time constraints[J]. Computers & industrial engineering, 2003, 44(3):409-424.
[6] BURKE E K, GENDREAU M, HYDE M, et al. Hyper-heuristics:a survey of the state of the art[J]. Journal of the operational research society, 2013, 64(12):1695-1724.
[7] ELHAG A, ÖZCAN E. A grouping hyper-heuristic framework:application on graph colouring[J]. Expert systems with applications, 2015, 42(13):5491-5507.
[8] KALENDER M, KHEIRI A, ÖZCAN E, et al. A greedy gradient-simulated annealing selection hyper-heuristic[J]. Soft computing, 2013, 17(12):2279-2292.
[9] AHMED L N, ÖZCAN E, KHEIRI A. Solving high school timetabling problems worldwide using selection hyper-heuristics[J]. Expert systems with applications, 2015, 42(13):5463-5471.
[10] RUIZ R, VÁZQUEZ-RODRÍGUEZ J A. The hybrid flow shop scheduling problem[J]. European journal of operational research, 2010, 205(1):1-18.
[11] CHEN Huaping, DU Bing, HUANG G Q. Scheduling a batch processing machine with non-identical job sizes:a clustering perspective[J]. International journal of production research, 2011, 49(19):5755-5778.
[12] LIN T L, HORNG S J, KAO T W, et al. An efficient job-shop scheduling algorithm based on particle swarm optimization[J]. Expert systems with applications, 2010, 37(3):2629-2636.
[13] WEI Lijun, ZHANG Defu, CHEN Qingshan. A least wasted first heuristic algorithm for the rectangular packing problem[J]. Computers & operations research, 2009, 36(5):1608-1614.
[14] FISHER H, THOMPSON G L. Probabilistic learning combinations of local job-shop scheduling rules[C]//MUTH J F, THOMPSON G L. Industrial Scheduling. Englewood Cliffs, New Jersey:Prentice Hall, 1963:225-251.

备注/Memo

备注/Memo:
收稿日期:2016-01-03。
基金项目:国家自然科学基金项目(70872076);上海市科技创新行动计划(11dz1121803).
作者简介:陈云云(1992-),女,硕士研究生;张志英(1971-),男,副教授.
通讯作者:张志英,E-mail:zyzhang08@tongji.edu.cn.
更新日期/Last Update: 2016-09-02