Skip to main content

Statistical Aspects

  • Chapter
Sequencing Theory

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 69))

  • 37 Accesses

Abstract

Our treatment of the shop scheduling problem in the preceding chapter has been combinatorial in character. Because of the tremendous number of schedules involved and the fact that the number of distinct schedule times is much smaller than the number of schedules, sampling from the set of semi-active schedules has elicited a great deal of theoretical study [3, 7, 9, 12, 14]. Each of these studies has essentially been the application of particular rules or procedures to generate a subset of schedules with certain properties. The characteristics of schedules in each subset determine the form of the conditional distribution of schedule values. Certainly, some conditional distribution is likely to be preferable to the others. For example, if one were to seek a good schedule from a randomly generated set of schedules, it would be more efficient to sample from a conditional distribution in which a heavier mass of schedules is very close to the optimal. Sampling from such a distribution would increase the probability of selecting good schedules while decreasing the probability of selecting others.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashour, S., “A Decomposition Approach for the Machine Scheduling Problem” The International Journal of Production Research, Vol. 6, No. 2, 1967, pp. 109–122.

    Article  Google Scholar 

  2. Ashour, S., “A Procedure for Finding an Economical Solution to Machine Scheduling Problems” presented before the Operations Research Around the World Meeting, Tokyo-Kyoto, Japan, August 14–17, 1967.

    Google Scholar 

  3. Ashour, S., “A Statistical Analysis of Production Scheduling Systems” Journal of Operations Research Society of Japan, Vol. 12, No. 2, 1970, pp. 65–86.

    Google Scholar 

  4. Ashour, S., “A Modified Decomposition Algorithm for Scheduling Problems” The International Journal of Production Research, Vol. 8, No. 3, 1970, pp. 281–284.

    Article  Google Scholar 

  5. Conway, R. W., W. L. Maxweil and L. W. Miller, Theory of Scheduling, Addison-Wesley Publishing Company, Reading, Massachusetts, 1967, pp. 100–102.

    Google Scholar 

  6. Elmaghraby, S. E., “The Machine Sequencing Problem - Review and Extensions” Naval Research Logistics Quarterly, Vol. 15, No. 2, 1968, pp. 205–232.

    Google Scholar 

  7. Fisher, H. and G. L. Thompson, “Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules” Chapter 15 in Industrial Scheduling, (eds. J. F. Muth and G. L. Thompson), Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1963.

    Google Scholar 

  8. Giffler, B. and G. L. Thompson, “Algorithms for Solving Production Scheduling Problems” Operations Research, Vol. 8, No. 4, 1960, pp. 487–503.

    Article  Google Scholar 

  9. Giffler, B., G. L. Thompson and V. VanNess, “Numerical Experience with Linear and Monte Carlo Algorithms for Solving Production Scheduling Problems” Chapter 3 in Industrial Scheduling, (eds. J. F. Muth and G. L. Thompson), Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1963.

    Google Scholar 

  10. Heller, J., “Combinatorial, Probabilistic and Statistical Aspects of an M x J Scheduling Problem” Report NYO-2540, Atomic Energy Commission Computed and Applied Mathematics Center, Institute of Mathematical Science, New York University, New York, February 1959.

    Google Scholar 

  11. Heller, J., “Combinatorial Properties of Machine Shop Scheduling” Report NYO-2879, Atomic Energy Commission Computed and Applied Mathematics Center, Institute of Mathematical Science, New York University, New York, July 1959.

    Google Scholar 

  12. Heller, J., “Some Numerical Experiments for an M x J Flow Shop and its Decision-Theoretical Aspects” Operations Research, Vol. 8, No. 2, 1960, pp. 178–184.

    Article  Google Scholar 

  13. Heller, J. and G. Logemann, “An Algorithm for the Construction and Evaluation of Feasible Schedules” Management Science, Vol. 8, No. 2, 1962, pp. 168–183.

    Article  Google Scholar 

  14. Nugent, C. E., “On Sampling Approaches to the Solution of n-by-m Static Sequencing Problem” Ph.D. Thesis, Cornell University, Ithaca, New York, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1972 Springer-Verlag Berlin • Heidelberg

About this chapter

Cite this chapter

Ashour, S. (1972). Statistical Aspects. In: Sequencing Theory. Lecture Notes in Economics and Mathematical Systems, vol 69. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80693-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80693-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05877-9

  • Online ISBN: 978-3-642-80693-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics