单位加工时间、机器少、地点少的开放式车间选路问题的固定参数算法
A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations
摘要：
开放式车间问题是要找到一个最小完工时间表，在$p_{iq}$时间内在每台机器$M_q$上处理每个工件$J_i$，使得在任何时候，每台机器最多处理一个工件，并且每个工件最多由一台机器处理。我们研究了一个问题的变种，其中的工作位于顶点的边加权图。权重决定了机器在不同顶点的作业之间移动所需的时间。我们证明了$m$机器和$n$单位时间作业在$g$顶点上的问题在$2^{O(gm^2\log gm)}+O(mn\log n)$时间内是可解的。
英文摘要：
The open shop problem is to find a minimum makespan schedule to process each job $J_i$ on each machine $M_q$ for $p_{iq}$ time such that, at any time, each machine processes at most one job and each job is processed by at most one machine. We study a problem variant in which the jobs are located in the vertices of an edge-weighted graph. The weights determine the time needed for the machines to travel between jobs in different vertices. We show that the problem with $m$ machines and $n$ unit-time jobs in $g$ vertices is solvable in $2^{O(gm^2\log gm)}+O(mn\log n)$ time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
