A Note on Single-Machine Scheduling with Deteriorating Jobs

Article Preview

Abstract:

In many real life applications, jobs deteriorate at a certain rate while waiting to be processed. This paper introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. We show that the single-machine makespan minimization problem remains polynomially solvable under the proposed model. We also show that an optimal schedule of the total completion time minimization problem is polynomially solvable under some cases and-shaped with respect to job deterioration rates for other cases.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Pages:

483-486

Citation:

Online since:

March 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Biskup: Eur. J Opl. Res. Vol. 188 (2008), p.315.

Google Scholar

[2] A.S. Kunnathur and S.K. Gupta: Eur. J. Operat. Res. Vol. 47(1990), p.56.

Google Scholar

[3] C.L. Zhao, Q.L. Zhang and H.Y. Tang: Acta. Automat. Sinica. Vol. 29(2003), p.531.

Google Scholar

[4] G. Mosheiov: Math. Comput. Modelling. Vol. 41(2005), p.883.

Google Scholar

[5] J.B. Wang, Y. Jiang and G.Wang: Int. J Adv. Manuf. Technol. Vol. 41(2009), p.1221.

Google Scholar