Skip to main content
SpringerLink
Log in

Minimizing the number of tardy jobs with stochastically-ordered processing times

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ordered processing times.

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

Similar content being viewed by others

References

  • van den Akker, J. M. Hoogeveen, J. A. (2007, to appear). Minimizing the number of late jobs in case of stochastic processing times with minimum success probabilities. Journal of Scheduling.

  • Balut, S. J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19, 1283–1288.

    Google Scholar 

  • Kise, H., & Ibaraki, T. (1983). On Balut’s algorithm and NP-completeness for a chance constrained scheduling problem. Management Science, 29, 384–388.

    Article  Google Scholar 

  • Moore, J. M. (1968). An n Job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102–109.

    Google Scholar 

  • Ross, S. M. (1996). Stochastic processes (2nd ed.). New York: Wiley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Engineering, American University of Armenia, Yerevan, Armenia

    Dan Trietsch

  2. Tuck School, Dartmouth College, Hanover, NH, 03755, USA

    Kenneth R. Baker

Authors
  1. Dan Trietsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth R. Baker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kenneth R. Baker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trietsch, D., Baker, K.R. Minimizing the number of tardy jobs with stochastically-ordered processing times. J Sched 11, 71–73 (2008). https://doi.org/10.1007/s10951-007-0022-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0022-z

Keywords

Search

Navigation