全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

考虑周期预防性维护的异速并行机集成调度研究

DOI: 10.3969/j.issn.1006-7043.201307059

Keywords: 异速并行机调度, 预防性维护, 整数规划, 启发式算法, 混合遗传算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对异速并行机系统,考虑机器具有周期预防性维护的不可用约束,建立生产调度与预防性维护集成优化的混合整数规划模型。基于改进LPT的机器负载均衡技术与基于最小装箱松弛法的单机调度优化算法,设计了有效的启发式算法HCA,与Cplex的数据试验比较表明,对于中小规模问题其解与最优解或低界的百分比误差小于10%。设计了结合装箱算法的混合遗传算法HGA,与HCA对比的数据试验表明,对于大规模问题HGA表现更加优异。通过与独立决策比较的数据实验证明了生产调度与设备维护的联合决策模型效果更优,可有效协调车间生产与维修的总体计划。

References

[1]  LEE C Y. Machine scheduling with an availability constraint[J]. Journal of Global Optimization,1996,9(3):395-416.
[2]  MOSHEIOV G,SARIG A. Scheduling a maintenance activity to minimize total weighted completion time[J]. Computers and Mathematics with Applications, 2009,57(4):619-623.
[3]  YANG S J. Minimizing total completion time on a single machine with a flexible maintenance activity[J]. Computers & Operations Research,2011,38(4):755-757.
[4]  LIAO L W. Parallel machine scheduling with machine availability and eligibility constraints[J]. European Journal of Operational Research,2008,184(2):458-467.
[5]  RACEM M. Identical parallel machine scheduling under availability constraints to minimize the sum of completion times[J]. European Journal of Operational Research,2009,197(3):1150-1165.
[6]  TAN Z Y,CHEN Y. On the exact bounds of SPT for scheduling on parallel machines with availability constraints[J].International Journal of Production Economics,2013,146(1):293-299.
[7]  CHOU J H,LOW C Y. A single-machine scheduling problem with maintenance activities to minimize makespan[J].Applied Mathematics and Computation,2010,215(11):3929- 3935.
[8]  XUEP F. Single machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times[J]. Applied Mathematics and Computation 2014,226:415-417.
[9]  LEE J Y. Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance[J]. Computers & Operations Research,2012,39(9):2196-2205.
[10]  YANG S J. Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration[J]. Computers & Industrial Engineering, 2012,62(1):271-275.
[11]  蒋志高,董明. 考虑维护且加工时间可变的单机调度问题研究[J]. 工业工程与管理,2011,16(3):68-74.JIANG Zhigao,DONG Ming. Study on single machine problem with maintenance and variable processing time [J]. Industrial Engineering and Management,2011,16(3):68-74.
[12]  CHEN J S. Scheduling of non-resumable jobs and flexible maintenance activities on a single machine to minimize makespan[J]. European Journal of Operational Research,2008, 190:90-120.
[13]  金玉兰,蒋祖华.预防性维修计划和生产调度的多目标优化[J].哈尔滨工程大学学报,2011,32(9):1205-1209.JIN Yulan,JIANG Zuhua. Multi-objective optimization research on preventive maintenance and production scheduling[J].Journal of Harbin Engineering University,2011,32(9):1205-1209.
[14]  崔维伟,陆志强. 单机系统的生产调度与预防性维护的集成优化[J]. 上海交通大学学报,2012,46 (12):2009-2013.CUI Weiwei,LU Zhiqiang. Integrating production scheduling and preventive maintenance planning for a single machine[J]. Journal of Shanghai Jiaotong University,2012,46 (12):2009-2013.
[15]  SUN K B. Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines[J]. International Journal of Production Economics, 2010,124(1):151-158.
[16]  程贞敏,李洪兴. 最小化时间表长的平行机调度近似算法研究[J]. 北京师范大学学报,2012,48(1):11-15.CHENG Zhenmin,LI Hongxin. Approximated algorithm for identical machine scheduling with minimized makespan [J]. Journal of Beijing Normal University,2012,48(1):11-15.
[17]  XU D H. Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan [J]. Computers & Operations Research,2008,35(4):1344-1349.
[18]  GUPTA J N D. A new heuristic algorithm for the one-dimensional bin-packing problem[J]. Production Planning & Control,1999,10(6):598-603.
[19]  BURKARD R E. A note on MULTIFIT scheduling for uniform machines[J]. Computing,1998,61(1):277-283.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133