数学季刊（英文版）
數學季刊（英文版）
수학계간（영문판）
CHINESE QUARTERLY JOURNAL OF MATHEMATICS
2008年
2期
202-206
,共5页
position restriction scheduling%matching algorithm%assignment problem
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.
