Skip to main content
Log in

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, Mass., 1967).

    Google Scholar 

  2. K.R. Baker,Introduction to Sequencing and Scheduling, (Wiley, New York, 1974).

    Google Scholar 

  3. J.K. Lenstra,Sequencing by Enumerative Methods, Mathematical Centre Tract 69 (Mathematisch Centrum, Amsterdam, 1976).

    Google Scholar 

  4. A.H.G. Rinnooy Kan,Machine Scheduling Problems: Classification, Complexity and Computation (Nijhof, The Hague, 1976).

    Google Scholar 

  5. E.G. Coffman, Jr (ed.),Computer & Job-Shop Scheduling Theory (Wiley, New York, 1976).

    Google Scholar 

  6. S. French,Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, (Horwood, Chichester, 1982).

    Google Scholar 

  7. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

J.B., W.C., R.S. et al. Preface. Ann Oper Res 7, VII–XI (1986). https://doi.org/10.1007/BF02186432

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02186432

Navigation