Single-machine scheduling with maintenance and repair rate-modifying activities

Single-machine scheduling with maintenance and repair rate-modifying activities
复制标题

DOI:
10.1016/s0377-2217(00)00322-2
复制
发表时间:
2001-12
期刊:
Eur. J. Oper. Res.
影响因子:
--
通讯作者:
Chung-Yee Lee;Chen-Sin Lin
Chung-Yee Lee;Chen-Sin Lin
中科院分区:
其他
文献类型:
--
作者:
Chung-Yee Lee;Chen-Sin Lin

文献摘要

被引文献

相似文献

调度领域的大多数论文都是基于机器总是以恒定速度可用的假设。然而,在工业应用中,机器在运行一段时间后处于不正常状态是很常见的。针对电子装配线表面贴装技术中常见的一个问题,本文研究了涉及维修和维护率调整活动的调度问题。当机器以低于有效速度运行时,生产计划人员可以决定停止机器并对其进行维护,或者等待并稍后对其进行维护。如果选择继续运行机器而不修理它,很可能机器会发生故障,需要立即修理。维护和修理活动都可以改变机器的速度,从低于正常的生产速度到正常的生产速度。因此,我们称之为利率调整活动。我们在这里的目的是同时排序作业和安排维护活动,以优化常规性能度量。在本文中,我们假设加工时间是确定性的,而机器故障是一个遵循一定分布的随机过程。我们考虑两种类型的处理情况:可恢复和不可恢复。我们分别研究了目标函数问题,如期望最大完工时间、总期望完成时间、最大期望延迟和最大期望延迟。得到了几个有趣的结果,特别是对于不可恢复的情况。
Most papers in the scheduling field are based on the assumption that machines are always available at constant speed. However, in industry applications, it is very common for a machine to be in subnormal condition after running for a certain period of time. Motivated by a problem commonly found in the surface-mount technology of electronic assembly lines, this paper deals with scheduling problems involving repair and maintenance rate-modifying activities. When a machine is running at less than an efficient speed, a production planner can decide to stop the machine and maintain it or wait and maintain it later. If the choice is made to continue running the machine without fixing it, it is possible that the machine will break down and repair will be required immediately. Both maintenance and repair activities can change the machine speed from a sub-normal production rate to a normal one. Hence, we call them rate-modifying activities. Our purpose here is to simultaneously sequence jobs and schedule maintenance activity to optimize regular performance measures. In this paper, we assume that processing time is deterministic, while machine break down is a random process following certain distributions. We consider two types of processing cases: resumable and nonresumable. We study problems with objective functions such as expected makespan, total expected completion time, maximum expected lateness, and expected maximum lateness, respectively. Several interesting results are obtained, especially for the nonresumable case.