Skip to main content
SpringerLink
Log in

Dynamic Scheduling Problem of Batch Processing Machine in Semiconductor Burn-in Operations

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

The dynamic scheduling problem of batch processing machine in semiconductor burn-in operations is studied and the objective is to minimize the total flow time of all jobs. This paper presents a constraint programming approach and develops different bounds, i.e., job-based bound and batch-based bound which can be embedded in branch and bound procedure to further improve the efficiency of the procedure. Also, some properties of the problem are also developed to further reduce the complexity of the problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Chandru, V., Lee, C.-Y., Uzsoy, R.: Minimizing total completion time on batch processing machines. International Journal of Production Research 31, 2097–2121 (1993a)

    Article  Google Scholar 

  2. Chandru, V., Lee, C.-Y., Uzsoy, R.: Minimizing total completion time on a batch processing machine with job families. Operations Research letter 13, 61–65 (1993b)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chang, P.C., Wang, H.M., Su, L.H.: Scheduling job with burn in board constraint on Semiconductor Burn-In operations to minimize the mean flow time. In: Proceeding of the 5th Annual Conference on Industrial Engineering-Theory, Applications, and Practice, Hsin-Chu Taiwan, R.O.C., December 13-15 (2000)

    Google Scholar 

  4. Chang, P.C., Wang, H.M.: A Genetic Algorithm to minimize makespan for dynamic single batch processor scheduling. In: Proceeding of the 33rd International Conference on Computers and Industrial Engineering, pp. 834–840 (2004a)

    Google Scholar 

  5. Chang, P.C., Wang, H.M.: A heuristic for a batch processing machine scheduled to minimize total completion time with non-identical job sizes. International Journal of Advanced Manufacturing Technology 24, 615–620 (2004b)

    Article  Google Scholar 

  6. Dessouky, M.I., Deogun, J.S.: Sequencing jobs with unequal ready times to minimize mean flow time. SIAM Journal of Computing 10, 192–202 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. DuPont, L., Jolai Ghazvini, F.: A branch and bound algorithm for minimizing mean flow time on a single batch processing machine. International Journal of Industrial Engineering 4, 197–203 (1997)

    Google Scholar 

  8. DuPont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research 29, 807–819 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kempf, K.G., Uzsoy, R., Wang, C.-S.: Scheduling a Single Batch Processing Machine with Secondary Resource Constraints. Journal of Manufacturing Systems 17, 37–51 (1998)

    Article  Google Scholar 

  10. Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40, 764–775 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lee, C.-Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine. International Journal of Production Research 37, 219–236 (1999)

    Article  MATH  Google Scholar 

  12. Li, C.-L., Lee, C.-Y.: Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research 96, 564–569 (1997)

    Article  MATH  Google Scholar 

  13. ILOG, ILOG OPL Studio 3.5 User’s Manual, ILOG, France (2001)

    Google Scholar 

  14. Jolai Ghazvini, F., Dupont, L.: Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International Journal of Production Economics 55, 273–280 (1998)

    Article  Google Scholar 

  15. Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics 87, 141–147 (2004)

    Article  Google Scholar 

  16. Sung, C.S., Choung, Y.I.: Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research 120, 559–574 (2000)

    Article  MATH  Google Scholar 

  17. Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research 32, 1615–1635 (1994)

    Article  MATH  Google Scholar 

  18. Uzsoy, R., Wang, C.S.: A Genetic Algorithm to Minimize Maximum Lateness on a Batch Processing Machine. Computers and Operations Research 29, 1621–1640 (2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Yuan Ze University, 135 Yuan-Tung Road, Chungli, Taoyuan, 32026, Taiwan, R.O.C.

    Pei-Chann Chang, Yun-Shiow Chen & Hui-Mei Wang

  2. Department of Industrial Management, Van Nung University,  

    Hui-Mei Wang

Authors
  1. Pei-Chann Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yun-Shiow Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hui-Mei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, PC., Chen, YS., Wang, HM. (2005). Dynamic Scheduling Problem of Batch Processing Machine in Semiconductor Burn-in Operations. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_20

Download citation

  • DOI: https://doi.org/10.1007/11424925_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation