Batch scheduling of step deteriorating jobs

Author name used in this publication: T. C. E. ChengAuthor name used in this publication: C. T. Ng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Single machine parallel-batch scheduling with deteriorating jobs

AbstractWe consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n5) time algorithm for minimizing the number of tardy jobs, and an O(n2) time algorithm for minimizing the total weighted completion time. Furthermore, we prove that the problem for minimizing the weighted number of tardy jobs is binary NP-hard

Some scheduling problems with deteriorating jobs and learning effects

Author name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Due-date assignment and parallel-machine scheduling with deteriorating jobs

Author name used in this publication: T. C. E. ChengAuthor name used in this publication: L. Y. KangAuthor name used in this publication: C. T. Ng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Due-date assignment and single machine scheduling with deteriorating jobs

Author name used in this publication: T. C. E. ChengAuthor name used in this publication: L. KangAuthor name used in this publication: C. T. Ng2003-2004 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe