This paper studies the problem of scheduling n two-stage jobs on m multiple two-stage flowshops, with the objective of minimizing the makespan. The problem is NP-hard even when m is a fixed constant, and becomes strongly NP-hard when m is part of the input. A 2.6-approximation algorithm along with its analysis is presented for an arbitrary $m\ge 2$. This is the first approximation algorithm for multiple flowshops when the number m of flowshops is part of the input. The fact that m is part of the input and the time complexity $O(n\log n)$ of the algorithm demonstrate that the problem, which plays an important role in the current research in cloud computing and data centers, can be solved efficiently with a reasonable level of satisfaction.

本文研究了在m个多个两级流水车间上调度n个两级作业的问题，目的是最大程度地减少工期。即使m是一个固定常数，问题也是NP-hard ，而当m是输入的一部分时，问题就变得很NP-hard 。提出了2.6近似算法及其分析$米\ge 2$。当流水车间的数量m是输入的一部分时，这是多个流水车间的第一种近似算法。m是输入和时间复杂度的一部分的事实$Ø（ñ\mathrm{日志}ñ）$ 该算法的证明表明，该问题在当前对云计算和数据中心的研究中起着重要作用，并且可以以合理的满意水平得到有效解决。