Journal of the Operational Research Society

, Volume 59, Issue 3, pp 416–420

Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect

Technical Note

DOI: 10.1057/palgrave.jors.2602363

Cite this article as:
Kuo, WH. & Yang, DL. J Oper Res Soc (2008) 59: 416. doi:10.1057/palgrave.jors.2602363

Abstract

In this paper, we study a single-machine scheduling problem with the cyclic process of an aging effect. This phenomenon appears in many realistic production processes. Thus, it is important to consider the phenomenon in scheduling problems. We analyse the single-machine makespan scheduling problem with two different aging effect models and provide a polynomial time algorithm to solve the problem.

Keywords

single-machine aging effect makespan 

Copyright information

© Palgrave Macmillan Ltd 2007

Authors and Affiliations

  1. 1.National Formosa UniversityYun-LinROC

Personalised recommendations