Scheduling flow shops with operators
研究了操作员数量少于机器数量的流水车间调度问题，包括固定工序下分配操作员和同时分配操作员与调度作业，提出了下界和启发式算法，实验表明方法接近理论下界。
This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines. We present complexity results and develop a new lower bound. Heuristic algorithms are designed for both problems. An experimental study is then conducted to evaluate the quality of our solving methods. The results show that the appropriate approach depends on the parameters of the problem, including the number of operators. The methods also provided results close to the theoretical lower bound in most of the cases.