An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life
复制标题

DOI:
10.1088/1757-899x/114/1/012052
复制
发表时间:
2016-02
期刊:
IOP Conference Series: Materials Science and Engineering
影响因子:
--
通讯作者:
Ari Setiawan;R. Wangsaputra;Yatna Yuwana Martawirya;Abdul Hakim Halim
Ari Setiawan;R. Wangsaputra;Yatna Yuwana Martawirya;Abdul Hakim Halim
中科院分区:
其他
文献类型:
--
作者:
Ari Setiawan;R. Wangsaputra;Yatna Yuwana Martawirya;Abdul Hakim Halim

文献摘要

被引文献

相似文献

本文讨论了由于切削刀具故障或寿命限制导致切削刀具不可用而导致的柔性制造系统 (FMS) 生产重新安排。 FMS 由与自动物料搬运系统集成的并行相同机器组成,并且完全自动运行。每台机器都具有相同的切削刀具配置,每个刀库上由不同几何切削刀具类型组成。这项工作通常需要两个阶段。考虑到切削刀具的寿命,每个阶段都有分配给机器的顺序操作。在实际情况中,切削刀具可能会在达到切削刀具寿命之前失效。本文的目的是开发一种在无人操作过程中刀具损坏并需要重新调度时的动态调度算法。该算法由四个步骤组成。第一步是生成初始计划,第二步是确定刀具故障时间,第三步是确定刀具故障时的系统状态,第四步是重新安排未完成的作业。解决该问题的方法是完全反应式调度和鲁棒主动式调度。新计划导致每个操作的开始时间和完成时间与初始计划有所不同。
This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule.