Skip to main content
SpringerLink
Log in

Single Machine Models (Stochastic)

  • Chapter
  • First Online:
Scheduling

  • 10k Accesses

Abstract

Stochastic models, especially with exponential processing times, may often contain more structure than their deterministic counterparts and may lead to results which, at first sight, seem surprising. Models that are NP-hard in a deterministic setting often allow a simple priority policy to be optimal in a stochastic setting.

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

  • J. Birge, J.B.G. Frenk, J. Mittenthal and A.H.G. Rinnooy Kan (1990) “Single Machine Scheduling Subject to Stochastic Breakdowns”, Naval Research Logistics Quarterly, Vol. 37, pp. 661–677.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Brown and H. Solomon (1973) “Optimal Issuing Policies under Stochastic Field Lives”, Journal of Applied Probability, Vol. 10, pp. 761–768.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Browne and U. Yechiali (1990) “Scheduling Deteriorating Jobs on a Single Processor”, Operations Research, Vol. 38, pp. 495–498.

    Article  MATH  Google Scholar 

  • C. Buyukkoc, P. Varaiya and J. Walrand (1985) “The c μ Rule Revisited”, Advances in Applied Probability, Vol. 17, pp. 237–238.

    Article  MathSciNet  MATH  Google Scholar 

  • Y.R. Chen and M.N. Katehakis (1986) “Linear Programming for Finite State Multi-Armed Bandit Problems”, Mathematics of Operations Research, Vol. 11, pp. 180–183.

    Article  MathSciNet  MATH  Google Scholar 

  • D.R. Cox and W.L. Smith (1961) Queues, John Wiley, New York.

    Google Scholar 

  • T.B. Crabill and W.L. Maxwell (1969) “Single Machine Sequencing with Random Processing Times and Random Due Dates”, Naval Research Logistics Quarterly, Vol. 16, pp. 549–554.

    Article  MathSciNet  MATH  Google Scholar 

  • C. Derman, G. Lieberman and S.M. Ross (1978) “A Renewal Decision Problem”, Management Science, Vol. 24, pp. 554–561.

    Article  MathSciNet  MATH  Google Scholar 

  • F.G. Forst (1984) “A Review of the Static Stochastic Job Sequencing Literature”, Opsearch, Vol. 21, pp. 127–144.

    MathSciNet  MATH  Google Scholar 

  • J.B.G. Frenk (1991) “A General Framework for Stochastic One Machine Scheduling Problems with Zero Release Times and no Partial Ordering”, Probability in the Engineering and Informational Sciences, Vol. 5, pp. 297–315.

    Article  MathSciNet  MATH  Google Scholar 

  • J.C. Gittins (1979) “Bandit Processes and Dynamic Allocation Indices”, Journal of the Royal Statistical Society Series B, Vol. 14, pp. 148–177.

    MathSciNet  MATH  Google Scholar 

  • K.D. Glazebrook (1981a) “On Nonpreemptive Strategies for Stochastic Scheduling Problems in Continuous Time”, International Journal of System Sciences, Vol. 12, pp. 771–782.

    Article  MathSciNet  MATH  Google Scholar 

  • K.D. Glazebrook (1981b) “On Nonpreemptive Strategies in Stochastic Scheduling”, Naval Research Logistics Quarterly, Vol. 28, pp. 289–300.

    Article  MathSciNet  MATH  Google Scholar 

  • K.D. Glazebrook (1982) “On the Evaluation of Fixed Permutations as Strategies in Stochastic Scheduling”, Stochastic Processes and Applications, Vol. 13, pp. 171–187.

    Article  MathSciNet  MATH  Google Scholar 

  • K.D. Glazebrook (1984) “Scheduling Stochastic jobs on a Single Machine Subject to Breakdowns”, Naval Research Logistics Quarterly, Vol. 31, pp. 251–264.

    Article  MathSciNet  MATH  Google Scholar 

  • K.D. Glazebrook (1987) “Evaluating the Effects of Machine Breakdowns in Stochastic Scheduling Problems”, Naval Research Logistics, Vol. 34, pp. 319–335.

    Article  MathSciNet  MATH  Google Scholar 

  • J.M. Harrison (1975a) “A Priority Queue with Discounted Linear Costs”, Operations Research, Vol. 23, pp. 260–269.

    Article  MathSciNet  MATH  Google Scholar 

  • J.M. Harrison (1975b) “Dynamic Scheduling of a Multiclass Queue: Discount Optimality”, Operations Research, Vol. 23, pp. 270–282.

    Article  MathSciNet  MATH  Google Scholar 

  • T.J. Hodgson (1977) “A Note on Single Machine Sequencing with Random Processing Times”, Management Science, Vol. 23, pp. 1144–1146.

    Article  MathSciNet  MATH  Google Scholar 

  • M.N. Katehakis and A.F. Veinott Jr. (1987) “The Multi-Armed Bandit Problem: Decomposition and Computation”, Mathematics of Operations Research, Vol. 12, pp. 262–268.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Koole and R. Righter (2001) “A Stochastic Batching and Scheduling Problem”, Probability in the Engineering and Informational Sciences, Vol. 15, pp. 65–79.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Nain, P. Tsoucas and J. Walrand (1989) “Interchange Arguments in Stochastic Scheduling”, Journal of Applied Probability, Vol. 27, pp. 815–826.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pinedo (1983) “Stochastic Scheduling with Release Dates and Due Dates”, Operations Research, Vol. 31, pp. 559–572.

    Article  MATH  Google Scholar 

  • M. Pinedo (2007) “Stochastic Batch Scheduling and the “Smallest Variance First” Rule”, Probability in the Engineering and Informational Sciences, Vol. 21, pp. 579–595.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Pinedo and E. Rammouz (1988) “A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair”, Probability in the Engineering and Informational Sciences, Vol. 2, pp. 41–49.

    Article  MATH  Google Scholar 

  • M.H. Rothkopf (1966a) “Scheduling Independent Tasks on Parallel Processors”, Management Science, Vol. 12, pp. 437–447.

    Article  MathSciNet  Google Scholar 

  • M.H. Rothkopf (1966b) “Scheduling with Random Service Times”, Management Science, Vol. 12, pp. 707–713.

    Article  MathSciNet  MATH  Google Scholar 

  • S.C. Sarin, G. Steiner and E. Erel (1990) “Sequencing Jobs on a Single Machine with a Common Due Date and Stochastic Processing Times”, European Journal of Operational Research, Vol. 51, pp. 188–198.

    Article  MATH  Google Scholar 

  • R.R. Weber (1992) “On the Gittins Index for Multi-Armed Bandits”, Annals of Applied Probability, Vol. 2, pp. 1024–1033.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Whittle (1980) “Multi-armed Bandits and the Gittins Index”, Journal of the Royal Statistical Society Series B, Vol. 42, pp. 143–149.

    MathSciNet  MATH  Google Scholar 

  • P. Whittle (1981) “Arm Acquiring Bandits”, Annals of Probability, Vol. 9, pp. 284–292.

    Article  MathSciNet  MATH  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). Single Machine Models (Stochastic). In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_10

Download citation

Publish with us

Policies and ethics

Search

Navigation