两台机器的流水作业问题的多项式时间算法：固定结点数的非对称网络
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
摘要：
研究了非对称网络上两台机器的路由流水车间问题。对于这个问题，我们讨论了最优调度的性质，并提出了一个多项式时间算法，假设网络的节点数是有界的常数。据我们所知，这是第一个积极的结果的复杂性与任意结构的运输网络，即使在对称网络的情况下的路由流水车间问题。这一结果与两台机器的路由开放车间问题的复杂性形成鲜明对比，即使在两个节点的网络上，该问题也被证明是NP难的。
英文摘要：
We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time algorithm assuming the number of nodes of the network to be bounded by a constant. To the best of our knowledge, this is the first positive result on the complexity of the routing flow shop problem with an arbitrary structure of the transportation network, even in the case of a symmetric network. This result stands in contrast with the complexity of the two-machine routing open shop problem, which was shown to be NP-hard even on the two-node network.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
