Nothing Special   »   [go: up one dir, main page]

Skip to main content

Minimizing Total Weighted Tardiness on Parallel Batch Process Machines Using Genetic Algorithms

  • Conference paper
Operations Research Proceedings 2002

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

Abstract

Recently, the electronics industry has become the largest industry in the world. A key aspect of this industry is the manufacturing of integrated circuits. In the past, sources of reducing costs were decreasing the size of the chips, increasing the wafer sizes and improving the yield, simultaneously with efforts to improve operational processes inside the wafer fabrication facilities (wafer fab). Currently, it seems that the improvement of operational processes creates the best opportunity to realize the necessary cost reductions [6].

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Balasubramanian, H. 2002. Minimizing Total Weighted Tardiness on Parallel Batch Processing Machines with Incompatible Job Families. Master Thesis, Arizona State University, Department ofIndustrial Engineering.

    Google Scholar 

  2. Devpura, A., J. W. Fowler, M. W. Carlyle, I. Perez. 2000. Minimizing Total Weighted Tardiness on Single Batch Process Machines with Incompatible Job Families. Proceedings Symposium on Operations Research, 366–371.

    Google Scholar 

  3. Mehta, S. V., R. Uzsoy. 1998. Minimizing Total Tardiness on a Single Batch Processing Machine with Incompatible Job Families. IIE Transactions, 30, 165–178.

    Google Scholar 

  4. Perez, I., J. W. Fowler, M. W. Carlyle. 2002. Minimizing Total Weighted Tardiness on a Single Batch Process Machine with Incompatible Job Families. Submitted to Computer and Operations Research.

    Google Scholar 

  5. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, New Jersey, Second Edition.

    Google Scholar 

  6. Schömig, A., J. W. Fowler. 2000. Modelling Semiconductor Manufacturing Operations. Proceedings of the 9 th ASIM Dedicated Conference Simulation in Production and Logistics, eds.: K. Mertins and M. Rabe, 55–64.

    Google Scholar 

  7. Vepsalainen, A., T. E. Morton. 1987. Priority Rules and Lead Time Estimates for Job Shop Scheduling with Weighted Tardiness Costs. Management Science, Vol. 33, 1036–1047.

    Article  Google Scholar 

  8. Wall, M. 1995. GaLib - A C++ Library of Genetic Algorithm Components, http://lancet.mit.edu/ga/

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mönch, L., Balasubramanian, H., Fowler, J.W., Pfund, M.E. (2003). Minimizing Total Weighted Tardiness on Parallel Batch Process Machines Using Genetic Algorithms. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55537-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00387-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics