Job-Shop Scheduling and Preventive Maintenance Considering Setup Time

doi:10.7652/xjtuxb201506003

您当前的位置：

首页 >

文章列表页 >

Job-Shop Scheduling and Preventive Maintenance Considering Setup Time

更新时间：2025-07-09

- Job-Shop Scheduling and Preventive Maintenance Considering Setup Time
- Vol. 49, Issue 6, Pages: 16-21(2015)
- 作者机构：
  
  西安交通大学机械工程学院,西安,710049
- 作者简介：
- 基金信息：
- DOI：10.7652/xjtuxb201506003
  CLC： TH166
- Online First：10 June 2015，
  
  Published：2015
- 稿件说明：
移动端阅览
Job-Shop Scheduling and Preventive Maintenance Considering Setup Time[J]. 2015, 49(6): 16-21.
DOI：

Job-Shop Scheduling and Preventive Maintenance Considering Setup Time[J]. 2015, 49(6): 16-21. DOI： 10.7652/xjtuxb201506003.

摘要

为了解决作业车间调度理论研究中两种常见但却不符合生产实际的理想假设所带来的问题

提出了一种考虑调整时间的作业车间调度与预防性维修集成方法。首先利用遗传算法得到单独考虑调整时间时的最优初始调度方案

然后依据初始调度方案中各机器的任务分配情况以及该机器的故障概率分布自适应确定其预防性维修方案

同时依据插入的预防性维修时间间隔采用右移策略对初始调度方案进行调整

最终得到优化的作业车间调度与预防性维修集成方案。通过对经典调度基准实例进行扩展来构造测试实例

进而验证所提方法的有效性。实验结果表明:单独考虑调整时间不仅能够提高车间调度性能

还能够使得依据机器的运行时间和故障概率分布得到的预防性维修方案更加合理

从而达到提高生产效率并降低预防性维修成本的目的

对于实际生产具有一定的指导意义。

Abstract

To close the gap between scheduling theory and practice from unrealistic assumptions

a method for integrating job-shop scheduling(JSP)and preventive maintenance(PM)is proposed. The original scheduling plan is generated by genetic algorithm

where the setup time is taken into account. Then the preventive maintenance plan for each machine according to the assigned tasks of the machine and its failure probability distribution is adaptively determined. The original schedule meanwhile should be slightly modified by right-shifting strategy according to inserted time intervals for PM activities

thus the optimal integrated plan of JSP and PM is obtained. A classical benchmark instance is extended and used to verify the effectiveness of the proposed method. The comparative results show that the explicit consideration of the setup time improves the scheduling performances and makes the PM plan generated according to the machining time and failure probability distribution much more reasonable.

关键词

Keywords

references

PENG Yunfang. Job shop scheduling with sequence-dependent setup times based on constraint programming approach [C]∥Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation. Berlin, Germany: Springer, 2013: 835-841.

GEN M, LIN L. Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey [J]. Journal of Intelligent Manufacturing, 2014, 25(5): 849-866.

SHA D Y, HSU C Y. A hybrid particle swarm optimization for job shop scheduling problem [J]. Computers Industrial Engineering, 2006, 51(4): 791-808.

LEI Deming, WU Zhiming. Crowding measure based multiobjective evolutionary algorithm for job shop scheduling [J]. The International Journal of Advanced Manufacturing Technology, 2006, 30(1/2): 112-117.

ZHANG Chaoyong, LI Peigen, RAO Yunqing, et al. A new hybrid GA/SA algorithm for the job shop scheduling problem [M]∥Evolutionary Computation in Combinatorial Optimization. Berlin, Germany: Springer, 2005: 246-259.

NOWICKI E, SMUTNICKI C. An advanced tabu search algorithm for the job shop problem [J]. Journal of Scheduling, 2005, 8(2): 145-159.

VELA C, VARELA R, GONZALEZ M. Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times [J]. Journal of Heuristics, 2010, 16(2): 139-165.

SHEN Liji. A tabu search algorithm for the job shop problem with sequence dependent setup times [J]. Computers Industrial Engineering, 2014, 78: 95-106.

ZHANG Yingjie, GE Liling. Reliability analysis of machining systems by considering system cost [EB/OL]. [2014-10-24]. http:∥www.tandfonline.com/doi/abs/10.1080 /0951192X. 2014.914630.

ALLAHVERDI A, GUPTA J N D, ALDOWAISAN T. A review of scheduling research involving setup considerations [J]. Omega, 1999, 27(2): 219-239.

ALLAHVERDI A, NG C T, CHENG T C E, et al. A survey of scheduling problems with setup times or costs [J]. European Journal of Operational Research, 2008, 187(3): 985-1032.

LU C C, LIN S W, YING K C. Robust scheduling on a single machine to minimize total flow time [J]. Computers Operations Research, 2012, 39(7): 1682-1691.

TANG Lixin, ZHANG Yanyan. Parallel machine scheduling under the disruption of machine breakdown [J]. Industrial Engineering Chemistry Research, 2009, 48(14): 6660-6667.

HE Wei, SUN Dihua. Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies [J]. The International Journal of Advanced Manufacturing Technology, 2013, 66(1/2/3/4): 501-514.

张超勇. 基于自然启发式算法的作业车间调度问题理论与应用研究 [D]. 武汉: 华中科技大学, 2007.

FISHER H, THOMPSON G L. Probabilistic learning combinations of local job-shop scheduling rules [J]. Industrial Scheduling, 1963, 3(2): 225-251.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Energy Efficiency Optimization of the Cryogenic Air Separation Process for Electronic-Grade Ultra Pure Nitrogen

Electrothermal Coupling Research on the Evolutionary Law of Anti-Corona Performance for High-Altitude Air-Cooled Generators

Windage Loss and Flow Characteristics in Impeller Back Gaps of sCO2 Radial Inflow Turbines

Review of the Application of EBSILON Software in Combined Heat and Power System Optimization

Mechanism and Optimal Control Strategy for Hysteresis in Rapid Dehumidification Response of Indirect Thermal Systems in Electric Vehicles

Related Author

No data

Related Institution

No data

⁰