Chinese Quarterly Journal of Mathematics ›› 2008, Vol. 23 ›› Issue (2): 202-206.

Previous Articles     Next Articles

Some Results on Position Restriction Scheduling Problems

  

  1. 1. Department of Mathematics and Information Sciences,North China University of Water Conservancy and Electric Power  2. Department of Mathematics,Zhengzhou University 
  • Received:2004-10-09 Online:2008-06-30 Published:2023-09-28
  • About author: CHEN You-jun(1980-), male, native of Huangchuan, Henan, M.S.D., engages in OR; LIN Yi-xun(1937-), male, native of Taizhou, Guangdong, a professor of Zhengzhou University, engages in OR.
  • Supported by:
    Supported by HSQJ(2006007)

Abstract: 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.

Key words: position restriction scheduling, matching algorithm, assignment problem

CLC Number: