English

应用科学学报 ›› 1998, Vol. 16 ›› Issue (4): 479-485.

• 论文 • 上一篇    下一篇

1/r,pj≡1/Lmax在应交工时间可控时有效点集的求解

孙世杰, R. J. Kibet   

  1. 上海大学数学系
  • 收稿日期:1997-01-25 修回日期:1997-08-08 出版日期:1998-12-31 发布日期:1998-12-31
  • 作者简介:孙世杰:教授,上海大学数学系,上海 201800
  • 基金资助:
    国家自然科学基金

The Construction of the Efficient Points Set for 1/r,pj≡1/Lmax with Controllable Due Dates

SUN SHIJIE, R. J. KIBET   

  1. Mathematics Department, Shanghai University, Shanghai 201800
  • Received:1997-01-25 Revised:1997-08-08 Online:1998-12-31 Published:1998-12-31

PDF

62

摘要： 对应交工时间可控时的排序问题1/r,pj≡1/Lmax,以F1表示Lmax,F2表示应交工时间滞后和,F1、F2同时极小化,文中给出一寻找有效点集的伪多项式时间算法

关键词: 可控加工时间, 排序, 最大迟后, 算法

Abstract: This paper considers the machine sequencing problem 1/r,pj≡1/Lmax with controllable due dates.Taking Lmax as F1 and the total delaies of due dates as F2,for the minimizing the F1 and F2 simultaneously,the paper constructs a pseudopolynomial time algorithm for finding out its efficient point set.

Key words: maximum lateness, algorithm, controllable due date, sequencing