Skip to main content

Factory scheduling using finite domains

  • Conference paper
  • First Online:
Logic Programming in Action (LPSS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 636))

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

  2. Anjewierden, A.: An Overview of PCE-Prolog: U. of Amsterdam, 1986.

    Google Scholar 

  3. Fox, M.S.: Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Pitman, London 1987.

    Google Scholar 

  4. Wright, P.K., Bourne, D.A.: Manufacturing Intelligence. Addison Wesley, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Comyn N. E. Fuchs M. J. Ratcliffe

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Evans, O.V. (1992). Factory scheduling using finite domains. In: Comyn, G., Fuchs, N.E., Ratcliffe, M.J. (eds) Logic Programming in Action. LPSS 1992. Lecture Notes in Computer Science, vol 636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55930-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-55930-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55930-6

  • Online ISBN: 978-3-540-47312-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics