Chinese Quarterly Journal of Mathematics ›› 2000, Vol. 15 ›› Issue (1): 27-35.

Previous Articles     Next Articles

A Class of Single Machine Scheduling Problem with Variable Processing Time

  

  1. 北方交通大学电子信息工程学院 北京100044,西南交通大学交通运输学院 四川成都610031,东南大学交通学院 江苏南京210096 
  • Received:1998-05-12 Online:2000-03-30 Published:2024-08-19
  • About author:ZHOU Xian-wei(1963-),male,native of Sichuan and postdoctor of Northern Jiaotong University,Ph.D.,en- gagesin multipoint communication,operational research,intelligent transportation system.
  • Supported by:
    Supported by National Postdoctoral Science Foundation of P.R.China.(9902)

Abstract: 提出了一类可变加工时间的单台机器排序问题,着重考虑如下的目标函数:最小化工件排序长度、完工时间之和误工工件数等等,且用受约束的等规模划分问题证明可变加工时间的单台机器排序问题的判定问题是NP-完全的. 

Key words:  , 单台机器, 排序问题, NP-完全, 可变交工时间, 复杂性理论,  ,

CLC Number: