限位排序的若干結(jié)果

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) 

刊 名： 數(shù)學(xué)季刊（英文版）  ISTIC PKU 英文刊名： CHINESE QUARTERLY JOURNAL OF MATHEMATICS  年，卷(期)： 2008 23(2)  分類號： O157.5  關(guān)鍵詞： position restriction scheduling   matching algorithm   assignment problem  

【限位排序的若干結(jié)果】相關(guān)文章：

汽車橫向穩(wěn)定桿上應(yīng)用橫向限位器04-27

有趣的排序教案01-28

數(shù)學(xué)排序教案01-07

購買裝備的若干心得04-27

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

中班數(shù)學(xué)《排序》05-10

大小排序的教案01-25

基于單機排序和多因素決策的飛機排序問題研究04-27

選舉結(jié)果批復(fù)04-28

正視結(jié)果作文07-29