arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.14692math.OC
收藏

具有作业相关存贮要求的流水作业的NP难和多项式时间可解的边界问题

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements

Alexander Kononov, Julia Memar, Yakov Zinder

摘要:

本文研究两台机器流水作业,其中每个工件从第一道工序开始到第二道工序结束都需要一个额外的资源(称为存储空间)。一个作业的存储需求由其第一个操作的处理时间决定。在任何时间点,此额外资源的总消耗量都不能超过给定的限制(称为存储容量)。目标是最小化完工时间,即最小化完成所有工作所需的时间。该问题是强NP难问题。本文分析了该参数--一个以处理时间表示的存储容量的下界--如何影响计算复杂性。

英文摘要:

The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is determined by the processing time of its first operation. At any point in time, the total consumption of this additional resource cannot exceed a given limit (referred to as the storage capacity). The goal is to minimise the makespan, i.e. to minimise the time needed for the completion of all jobs. This problem is NP-hard in the strong sense. The paper analyses how the parameter - a lower bound on the storage capacity specified in terms of the processing times, affects the computational complexity.

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

↑