Skip to main content
SpringerLink
Log in

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

  • Technical Note
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2

Similar content being viewed by others

References

  • Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: review and extensions. J Opl Res Soc 50: 711–729.

    Article  Google Scholar 

  • Bachman A and Janiak A (2004). Scheduling jobs with position-dependent processing times. J Opl Res Soc 55: 257–264.

    Article  Google Scholar 

  • Biskup D (1999). Single-machine scheduling with learning considerations. Eur J Opl Res 115: 173–178.

    Article  Google Scholar 

  • Cheng TCE, Ding Q and Lin BMT (2004). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1–13.

    Article  Google Scholar 

  • Hardy GH, Littlewood JE and Polya G (1934). Inequalities. Cambridge University Press: London.

    Google Scholar 

  • Mosheiov G (2001a). Scheduling problems with a learning effect. Eur J Opl Res 132: 687–693.

    Article  Google Scholar 

  • Mosheiov G (2001b). Parallel machine scheduling with a learning effect. J Opl Res Soc 52: 1165–1169.

    Article  Google Scholar 

  • Mosheiov G (2005). A note on scheduling deteriorating jobs. Math Comput Model 41: 883–886.

    Article  Google Scholar 

Download references

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.

Author information

Authors and Affiliations

  1. National Formosa University, Yun-Lin, Taiwan, ROC

    W-H Kuo & D-L Yang

Authors
  1. W-H Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D-L Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D-L Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuo, WH., Yang, DL. Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect. J Oper Res Soc 59, 416–420 (2008). https://doi.org/10.1057/palgrave.jors.2602363

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602363

Keywords

Search

Navigation