Skip to main content
SpringerLink
Log in

Parallel Machine Models (Stochastic)

  • Chapter
  • First Online:
Scheduling

  • 10k Accesses

Abstract

This chapter deals with parallel machine models that are stochastic counterparts of models discussed in Chapter 5 The body of knowledge in the stochastic case is somewhat less extensive than in the deterministic case.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • A.K. Agrawala, E.G. Coffman, Jr., M.R. Garey and S.K. Tripathi (1984) “A Stochastic Optimization Algorithm Minimizing Exponential Flow Times on Uniform Processors”, IEEE Transactions on Computers, C-33, pp. 351–356.

    Article  MathSciNet  Google Scholar 

  • J. Bruno, P. Downey and G. Frederickson (1981) “Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan”, Journal of the Association of Computing Machinery, Vol. 28, pp. 100–113.

    Article  MathSciNet  MATH  Google Scholar 

  • X.Q. Cai, X. Wu, and X. Zhou (2009) “Stochastic Scheduling on Parallel Machines to Minimize Discounted Holding Costs”, Journal of Scheduling, Vol. 12, pp. 375–388.

    Article  MathSciNet  MATH  Google Scholar 

  • K.M. Chandy and P.F. Reynolds (1975) “Scheduling Partially Ordered Tasks with Probabilistic Execution Times”, in Proceedings of the fifth Symposium on Operating Systems Principles, Operating Systems Review, Vol. 9, pp. 169–177.

    Google Scholar 

  • C.-S. Chang, R. Nelson and M. Pinedo (1992) “Scheduling Two Classes of Exponential Jobs on Parallel Processors: Structural Results and Worst Case Analysis”, Advances in Applied Probability, Vol. 23, pp. 925–944.

    Article  MathSciNet  Google Scholar 

  • C.-S. Chang, X.L. Chao, M. Pinedo and R.R. Weber (1992) “On the Optimality of LEPT and cμ Rules for Machines in Parallel”, Journal of Applied Probability, Vol. 29, pp. 667–681.

    Article  MathSciNet  MATH  Google Scholar 

  • E.G. Coffman, Jr., L. Flatto, M.R. Garey and R.R. Weber (1987) “Minimizing Expected Makespans on Uniform Processor Systems”, Advances in Applied Probability, Vol. 19, pp. 177–201.

    Article  MathSciNet  MATH  Google Scholar 

  • H. Emmons and M. Pinedo (1990) “Scheduling Stochastic Jobs with Due Dates on Parallel Machines”, European Journal of Operational Research, Vol. 47, pp. 49–55.

    Article  MathSciNet  MATH  Google Scholar 

  • E. Frostig (1988) “A Stochastic Scheduling Problem with Intree Precedence Constraints”, Operations Research, Vol. 36, pp. 937–943.

    Article  MathSciNet  MATH  Google Scholar 

  • J.C. Gittins (1981) “Multiserver Scheduling of Jobs with Increasing Completion Rates”, Journal of Applied Probability, Vol. 18, pp. 321–324.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Kämpke (1987a) “On the Optimality of Static Priority Policies in Stochastic Scheduling on Parallel Machines”, Journal of Applied Probability, Vol. 24, pp. 430–448.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Kämpke (1987b) “Necessary Optimality Conditions for Priority Policies in Stochastic Weighted Flow Time Scheduling Problems”, Advances in Applied Probability, Vol. 19, pp. 749–750.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Kämpke (1989) “Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors”, Operations Research, Vol. 37, pp. 126–133.

    Article  MathSciNet  MATH  Google Scholar 

  • Z. Liu and R. Righter (1997) “Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs”, Probability in the Engineering and Informational Sciences, Vol. 11, pp. 79–93.

    Article  MathSciNet  MATH  Google Scholar 

  • N. Megow, M. Uetz, and T. Vredeveld (2006) “Models and Algorithms for Stochastic Online Scheduling”, Mathematics of Operations Research, Vol. 31, pp. 513–525.

    Article  MathSciNet  MATH  Google Scholar 

  • R.H. Möhring, A.S. Schulz and M. Uetz (1999) “Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies”, Journal of the ACM, Vol. 46, pp. 924–942.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pinedo (1981a) “Minimizing Makespan with Bimodal Processing Time Distributions”, Management Science, Vol. 27, pp. 582–586.

    Article  MATH  Google Scholar 

  • M. Pinedo and J. Reed (2013) “The “Least Flexible Job first” Rule in Scheduling and Queueing”, Operations Research Letters, Vol. 41, pp. 618–621.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pinedo and G. Weiss (1979) “Scheduling of Stochastic Tasks on Two Parallel Processors”, Naval Research Logistics Quarterly, Vol. 26, pp. 527–535.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pinedo and G. Weiss (1984) “Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines”, Operations Research, Vol. 33, pp. 1381–1388.

    Article  MathSciNet  Google Scholar 

  • M. Pinedo and G. Weiss (1987) “The “Largest Variance First” Policy in some Stochastic Scheduling Problems”, Operations Research, Vol. 35, pp. 884–891.

    Article  MathSciNet  MATH  Google Scholar 

  • R. Righter (1988) “Job Scheduling to Minimize Expected Weighted Flow Time on Uniform Processors”, System and Control Letters, Vol. 10, pp 211–216.

    MathSciNet  MATH  Google Scholar 

  • R. Righter (1992) “Loading and Sequencing on Parallel Machines”, Probability in the Engineering and Informational Sciences, Vol. 6, pp. 193–201.

    Article  MATH  Google Scholar 

  • R. Righter and S. Xu (1991a) “Scheduling Jobs on Heterogeneous Processors”, Annals of Operations Research, Vol. 28, pp. 587–602.

    Article  MathSciNet  Google Scholar 

  • R. Righter and S. Xu (1991b) “Scheduling Jobs on Nonidentical IFR Processors to Minimize General Cost Functions”, Advances in Applied Probability, Vol. 23, pp. 909–924.

    Article  MathSciNet  MATH  Google Scholar 

  • L. Van der Heyden (1981) “Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan”, Mathematics of Operations Research, Vol. 6, pp. 305–312.

    Article  MathSciNet  MATH  Google Scholar 

  • R.R. Weber (1982a) “Scheduling Jobs with Stochastic Processing Requirements on Parallel Machines to Minimize Makespan or Flow Time”, Journal of Applied Probability, Vol. 19, pp. 167–182.

    Article  MathSciNet  MATH  Google Scholar 

  • R.R. Weber (1982b) “Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flow Time”, in Applied Probability - Computer Science: The Interface, R. Disney and T. Ott, (eds.), pp. 327–337, Birkhauser, Boston.

    Chapter  Google Scholar 

  • R.R. Weber, P. Varaiya and J. Walrand (1986) “Scheduling Jobs with Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flow Time”, Journal of Applied Probability, Vol. 23, pp. 841–847.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Weiss (1990) “Approximation Results in Parallel Machines Stochastic Scheduling”, Annals of Operations Research, Vol. 26, pp. 195–242.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Weiss and M. Pinedo (1980) “Scheduling Tasks with Exponential Processing Times to Minimize Various Cost Functions”, Journal of Applied Probability, Vol. 17, pp.187–202.

    Google Scholar 

  • S.H. Xu (1991a) “Minimizing Expected Makespans of Multi-Priority Classes of Jobs on Uniform Processors”, Operations Research Letters, Vol. 10, pp. 273–280.

    Article  MathSciNet  MATH  Google Scholar 

  • S.H. Xu (1991b) “Stochastically Minimizing Total Delay of Jobs subject to Random Deadlines”, Probability in the Engineering and Informational Sciences, Vol. 5, pp. 333–348.

    Article  MathSciNet  MATH  Google Scholar 

  • S.H. Xu, P.B. Mirchandani, S.P. Kumar and R.R. Weber (1990) “Stochastic Dispatching of Multi-Priority Jobs to Heterogeneous Processors”, Journal of Applied Probability, Vol. 28, pp. 852–861.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IOMS Dept Rm 8-59 KMC, NYU Stern School of Business, New York, NY, USA

    Michael L. Pinedo

Authors
  1. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Pinedo, M.L. (2016). Parallel Machine Models (Stochastic). In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_12

Download citation

Publish with us

Policies and ethics

Search

Navigation