arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.04157cs.DS
收藏

机器退化与工件相关的单机排序问题

Single machine scheduling with job-dependent machine deterioration

Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin

摘要:

研究了机器退化与工件相关的单机排序问题。在这个问题中,我们被赋予一个单一的机器与初始非负的维修水平,和一组工作,每个非抢占的加工时间和机器的恶化。这样的机器劣化量化了在处理作业之后机器维护水平的减少。为避免机器故障,应保证在任何时间点的非负维护水平;必要时,必须分配维护活动以恢复机器维护水平。该问题的目标是调度作业和维修活动,使总的完工时间最小化。维护活动有两种变体:在部分维护情况下,可以分配每个活动以将机器维护水平提高到不超过最大值的任何水平;在完全维护情况下,必须分配每个活动以将机器维护水平提高到最大值。在最近的工作中,在充分的维护情况下的问题已被证明是NP-难的,在部分维护情况下的问题的几个特殊情况下,在多项式时间内可解,但一般问题的复杂性是开放的。本文首先证明了部分维修情况下的问题是NP难的,从而解决了这一公开问题;然后设计了一个$2$ -近似算法。

英文摘要:

We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid machine breakdown, one should guarantee a non-negative maintenance level at any time point; and whenever necessary, a maintenance activity must be allocated for restoring the machine maintenance level. The goal of the problem is to schedule the jobs and the maintenance activities such that the total completion time of jobs is minimized. There are two variants of maintenance activities: in the partial maintenance case each activity can be allocated to increase the machine maintenance level to any level not exceeding the maximum; in the full maintenance case every activity must be allocated to increase the machine maintenance level to the maximum. In a recent work, the problem in the full maintenance case has been proven NP-hard; several special cases of the problem in the partial maintenance case were shown solvable in polynomial time, but the complexity of the general problem is left open. In this paper we first prove that the problem in the partial maintenance case is NP-hard, thus settling the open problem; we then design a $2$-approximation algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑