限位排序的若干结果
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.
作 者： 陈友军 林诒勋 CHEN You-jun LIN Yi-xun 作者单位： 陈友军,CHEN You-jun(Department of Mathematics and Information Sciences,North China University of Water Conservancy and Electric Power,Zhengzhou 450011,China)林诒勋,LIN Yi-xun(Department of Mathematics,Zhengzhou University,Zhengzhou 450052,China)
刊 名： 数学季刊（英文版） ISTIC PKU 英文刊名： CHINESE QUARTERLY JOURNAL OF MATHEMATICS 年，卷(期)： 2008 23(2) 分类号： O157.5 关键词： position restriction scheduling matching algorithm assignment problem