<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Browsing by Author "Jeng, A. A. K."

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item type:Item,
    A note on parallel-machine scheduling with deteriorating jobs
    (2007-06-01)
    Jeng, A. A. K.
    ;
    Lin, B. M. T.
    ;
    資訊工程學系
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Computer Science
    We consider a parallel-machine scheduling problem of minimizing the total completion time. The processing time of a job is a linear function of its starting time and deterioration rate. This problem is known to be NP-hard, even for the case with two machines. In this note, we generalize an existing lower bound for the two-machine case to the general case with an arbitrary number of machines. Despite the generalization concerning machine number, our bound has one extra term that makes our bound tighter than the existing one.