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

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

Acknowledgements

We thank the referee for his helpful comments and suggestions on an early version of this paper. This research is supported in part by the National Science Council of Taiwan, Republic of China, under grant number NSC-94-2213-E-150-016.