Some Results on Position Restriction Scheduling Problems

在这份报纸，我们首先考虑在单个 machine.The 上安排问题的位置限制问题在某些特殊情况中被解决了，特别因为限制处理时间 pj=1.We 获得的那些介绍由两部组成的匹配算法提供一些多项式时间算法解决我们进一步在无关的处理器上考虑一个问题的 them.Then 。

In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing time pj = 1. We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them. Then we further consider a problem on unrelated processors.