Skip to main content

Advertisement

SpringerLink
Log in

A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This research is motivated by the scheduling problem found in the burn-in operation of semiconductor final testing, where jobs are associated with release times, processing times, and sizes. The burn-in ovens are modeled as batch-processing machines which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity, and the processing time of a batch is equal to the longest time among all the jobs in the batch. Moreover, this paper attempts to schedule jobs on a single batch-processing machine to minimize makespan. A joint GA+DP algorithm is proposed involving two stages: (1) the formation of job sequence by genetic algorithm operators, and (2) the formation of batches by a dynamic programming algorithm. Computational experiments are given to examine the performance of the proposed algorithm. The experimental results indicate that the joint GA+DP approach has well improved on all instances with respect to solution quality and runtime.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lee C-Y, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40:764–775

    Article  MathSciNet  MATH  Google Scholar 

  2. Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol. DOI 10.1007/s00170-005-2585-1

  3. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  4. Pinedo M (2002) Scheduling-Theory, algorithms, and systems, Second edition. Prentice-Hall, Inc, New Jersey

    MATH  Google Scholar 

  5. Li C-L, Lee C-Y (1997) Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96:564–569

    Article  MATH  Google Scholar 

  6. Chandru V, Lee C-Y, Uzsoy R (1993) Minimizing total completion time on a batch processing machines. Int J Prod Res 31:2097–2121

    Article  Google Scholar 

  7. DuPont L, Ghazvini FJ (1997) A branch and bound algorithm for minimizing mean flow time on a single batch processing machine. Int J Ind Eng 4:197–203

    Google Scholar 

  8. Lee C-Y, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37:219–236

    Article  MATH  Google Scholar 

  9. Sung CS, Choung YI (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur J Oper Res 120:559–574

    Article  MATH  Google Scholar 

  10. Wang C-S, Uzsoy R (2002) A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput Oper Res 29:1621–1640

    Article  MathSciNet  Google Scholar 

  11. Gupta AK, Sivakumar AI (2005) Optimization of due-date objectives in scheduling semiconductor batch manufacturing. Int J Mach Tools Manuf. DOI 10.1016 /j.ijmachtools.2005.08.017

  12. Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32:1615–1635

    Article  MATH  Google Scholar 

  13. Zhang G, Cai X, Lee C-Y, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Nav Res Log 48:226–240

    Article  MATH  MathSciNet  Google Scholar 

  14. Ghazvini FJ, DuPont L (1998) Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. Int J Prod Econ 55:273–280

    Article  Google Scholar 

  15. Chang P-C, Wang H-M (2004) A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes. Int J Adv Manuf Technol 24:615–620

    Article  Google Scholar 

  16. DuPont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical jobs sizes: an exact procedure. Compu Oper Res 29:807–819

    Article  MATH  MathSciNet  Google Scholar 

  17. Melouk S, Damodaran P, Chang P-Y (2004) Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int J Prod Econ 87:141–147

    Article  Google Scholar 

  18. Chou F-D, Chang P-C, Wang H-M (2005) A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int J Adv Manuf Technol. DOI 10.1007/s00170-005-0194-7

  19. Pott CN, Kovalyov MY (2000) Scheduling with batching: A review. Eur J Oper Res 120:228–249

    Article  Google Scholar 

  20. Michalewicz Z (1996) Genetic algorithms+data structures=evolution algorithms. Springer, Berlin Heidelberg, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Ching Yun University, Jung-Li, Tao Yuan, Taiwan, 320, Republic of China

    Fuh-Der Chou

Authors
  1. Fuh-Der Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fuh-Der Chou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chou, FD. A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion. Int J Adv Manuf Technol 35, 587–595 (2007). https://doi.org/10.1007/s00170-006-0738-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-006-0738-5

Keywords

Search

Navigation