Single-machine scheduling to minimize the number of early jobs

被引:3
|
作者
Huang, R. H. [1 ]
Yang, C. L. [2 ]
机构
[1] Fu Jen Catholic Univ, Grad Inst Management, Taipei, Taiwan
[2] Fu Jen Catholic Univ, Dept Business Adm, Taipei, Taiwan
关键词
scheduling; polynomial; computational complexity;
D O I
10.1109/IEEM.2007.4419333
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This study proposes a novel method to determine the minimum number of early jobs on a single machine, and demonstrates that this problem can be solved in polynomial time. The method's complexity is O(n log n). This study also provides computational performance of this method on problems with various sizes.
引用
收藏
页码:955 / +
页数:2
相关论文
共 50 条