Skip to main content
SpringerLink
Log in

Parallel-machine scheduling under potential disruption

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we study a parallel-machine scheduling problem that arises in a disruptive environment. Such a problem deals with a situation when there is a possibility that a disruption will occur at a particular time and if it happens all machines will become unavailable for certain duration with a certain probability. Our goal is to schedule the jobs so that the expected sum of weighted completion times is minimized. We provide pseudo-polynomial time algorithms to solve the problem to optimality.

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

  1. Adiri I., Bruno J., Frostig E. and Rinnooy Kan A.H.G. (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica 26: 679–696

    Article  MATH  MathSciNet  Google Scholar 

  2. Bean J.C., Birge J.R., Mittenthal J. and Noon C.E. (1991). Matchup scheduling with multiple resources, release dates and disruptions. Oper. Res. 39: 470–483

    MATH  Google Scholar 

  3. Birge J. and Glazebrook K.D. (1988). Assessing the effects of machine breakdowns in stochastic scheduling. Oper. Res. Lett. 7: 267–271

    Article  MATH  MathSciNet  Google Scholar 

  4. Garey M.R., Tarjan R.E. and Wilfong G.T. (1988). One-processor scheduling with symmetric earlinesss and tardiness penalties. Math. Oper. Res. 13: 330–348

    Article  MATH  MathSciNet  Google Scholar 

  5. Lee C.-Y. (1996). Machine scheduling with an availability constraint. Special Issue on “Optimization on Scheduling Application”. J. Global Optim. 9: 363–384

    Article  Google Scholar 

  6. Lee C.-Y. (2004). Machine scheduling with availability constraints. In: Leung, J. (eds) Handbook of Scheduling, pp 22.1–22.13. CRC Press, Boca Raton

    Google Scholar 

  7. Lee C.-Y. and Liman S.D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29: 375–382

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee C.-Y. and Lin C.-S. (2001). Machine scheduling with maintenance and repair rate-modifying activities. Eur. J. Oper. Res. 135: 491–513

    Article  MathSciNet  Google Scholar 

  9. Lee C.-Y., Leung J. and Yu G. (2006). Two machine scheduling under disruptions with transportation considerations. J. Scheduling 9: 35–48

    Article  MATH  MathSciNet  Google Scholar 

  10. Lee, C.-Y., Yu, G.: Single machine scheduling under potential disruption. In: Oper. Res. Lett. (2006, to appear)

  11. Pinedo M.L. (2001). Scheduling Theory, Algorithms and Systems 2nd edn. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  12. Qi X., Bard J.F. and Yu G. (2006). Disruption management for machine scheduling, the case of SPT schedules. Int. J. Prod. Econ. 103: 166–184

    Article  Google Scholar 

  13. Schmidt G. (2000). Scheduling with limited machine availability. Eur. J. Oper. Res. 121: 1–15

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Logistics Management, The Hong Kong University of Science and Technology, Hong Kong, China

    Chung-Yee Lee

  2. Dell Inc., One Dell Way, Round Rock, TX, 78682, USA

    Gang Yu

Authors
  1. Chung-Yee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chung-Yee Lee.

Additional information

This research is supported in part by Hong Kong RGC Earmark grant HKUST 6145/03E.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, CY., Yu, G. Parallel-machine scheduling under potential disruption. Optimization Letters 2, 27–37 (2008). https://doi.org/10.1007/s11590-006-0041-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-006-0041-2

Keywords

Search

Navigation