English

应用科学学报 ›› 1997, Vol. 15 ›› Issue (1): 101-106.

• 论文 • 上一篇    下一篇

单机排序中加工时间可控时的延误工件数问题

孙世杰, R J kibet   

  1. 上海大学
  • 收稿日期:1995-09-11 修回日期:1996-06-05 出版日期:1997-03-31 发布日期:1997-03-31
  • 作者简介:孙世杰:副教授,上海大学数学系 201800
  • 基金资助:
    国家自然科学基金

THE SINGLE MACHINE SCHEDULING PROBLEM WITH NUMBER OF TARDY JOBS AND CONTROLLABLE PROCESSING TIMES

SUN SHIJIE, R J KIBET   

  1. Shanghai University, Shanghai 201800
  • Received:1995-09-11 Revised:1996-06-05 Online:1997-03-31 Published:1997-03-31

PDF

55

被引次数

1

摘要： 对一台机器加工时间可控时的延误工件数问题,如何构造延误工件数和加工时间减少量之间的关系曲线,文献[1]给出了一些理论结果,但未给出具体算法,该文在wj恒为1的条件下,分析了文献[1]所获结果,证明了曲线上有效值的个数,并从考虑延误工件数出发在文献[1]基础上给出了构造上述曲线的具体算法。

关键词: 多目标, 延误工件数, 排序, 可控加工时间

Abstract: For the single machine scheduling problem with number of tardy jobs and controllable processing times, Daniels and Sarin gave some results for con-trucking the tradeoff curve between the number of tardy jobs and the total crashing times, but they had not developed such an algorithm. Under the condition of all wj equal to one, this paper analyses some results given in their paper, proves the number of efficient values in the tradeoff curve. Basing on considering only on the number of tardy jobs and the method given by Daniela and Sarin, the peper develops also an algorithm for constracting such a tradeoff curve.

Key words: scheduling, multiple objective, number of tardy jobs, controllableprocessing times.