Skip to main content

Heuristic Search Approaches in a Real-World PCB Manufacturing System

  • Conference paper
Operations Research Proceedings 1997

Part of the book series: Operations Research Proceedings ((ORP,volume 1997))

  • 266 Accesses

Abstract

It is a well-known fact that scheduling jobs in manufacturing systems is difficult and, in general, belongs to the class of NP-complete problems (see [Pi95]). This even holds for static and deterministic shop floor systems. However, scheduling problems that occur in real-world situations are dynamic and have to cope with various uncertainties (machine breakdowns, etc.).

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

Access this chapter

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

Similar content being viewed by others

References

  1. Dueck, G., Scheuer, T.: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90 (1990) 161–175.

    Article  Google Scholar 

  2. Dueck, G.: New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics 104 (1993) 86–92.

    Article  Google Scholar 

  3. Georgi, G.: Job Shop Scheduling in der Produktion. Physika Verlag, Heidelberg (1995) 28.

    Book  Google Scholar 

  4. Glover, F., Laguna, M., Taillard, E., de Werra, D. (ed.): Tabu Search. Annals of Operations Research 41, J.C. Baltzer AG, Basel (1993).

    Google Scholar 

  5. D.E. Goldberg: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, New York (1989).

    Google Scholar 

  6. Günther, H.-O., Gronalt, M.: Montageplanung in der Elektronikfertigung. in: Corsten, Hans (Hrsg.): Handbuch Produktionsmanagement. Wiesbaden (1994).

    Google Scholar 

  7. Günther, H.-O., Gronalt, M., Piller, F.: Computergestützte Simulation eines hochautomatisierten Montagesystems. Management & Computer 2 (1994) 25–32.

    Google Scholar 

  8. Haupt, R.: A Survey of Priority Rule-Based Scheduling. OR Spektrum 11 (1989) 3–16.

    Article  Google Scholar 

  9. Kirkpatrick, S., Gelatt Jr., CD., Vecchi, M.P.: Optimization by simulated annealing. IBM Research Report RC 9355 (1982).

    Google Scholar 

  10. List, G.: Heuristische Verfahren der Ablaufplanung für Montagesysteme. Dissertation, TU-Wien (1995).

    Google Scholar 

  11. Pinedo, M.: Scheduling — Theory, Algorithms and Systems. Prentice Hall, New Jersey (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

List, G. (1998). Heuristic Search Approaches in a Real-World PCB Manufacturing System. In: Operations Research Proceedings 1997. Operations Research Proceedings, vol 1997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58891-4_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58891-4_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64240-4

  • Online ISBN: 978-3-642-58891-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics