限位排序的若干结果

限位排序的若干结果

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  

【限位排序的若干结果】相关文章：

汽车横向稳定杆上应用横向限位器04-27

有趣的排序教案01-28

数学排序教案01-07

购买装备的若干心得04-27

寒假的若干趣事作文04-26

中班数学《排序》05-10

大小排序的教案01-25

基于单机排序和多因素决策的飞机排序问题研究04-27

选举结果批复04-28

正视结果作文07-29