具有单个不可用区间的双机开放式车间调度的FPTAS
An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval
浏览论文内容
中文总结 AI 辅助
针对双机开放式车间调度中单机固定不可用区间问题，提出首个FPTAS，并开发七维伪多项式动态规划，解决二十年开放问题。
中文摘要 AI 辅助
我们考虑双机开放式车间调度问题，其中一台机器在固定区间内不可用。我们研究可恢复设置：被不可用区间中断的操作可以在机器恢复可用时无惩罚地继续执行。目标是最小化制造跨度（makespan）。尽管该问题是NP难的且已知若干近似算法，但它是否承认完全多项式时间近似方案（FPTAS）已开放二十年。我们通过给出第一个FPTAS肯定地解决了这个问题，从而加强了先前已知的多项式时间近似方案（PTAS）。作为中间结果，我们开发了一个具有七个状态维度的新的伪多项式动态规划，改进了文献中的十维公式。
英文摘要
We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.
发表机构
- Dalian University of Technology（大连理工大学）
- Dalian Minzu University（大连民族大学）
机构由 AI 辅助整理，请以论文原文为准。
