Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Minimization of Total Weighted Earliness and Tardiness on a Single Burn-In Oven U sing a Genetic Algorithm

단일 Burn-In Oven에서 Total Weighted Earliness와 Tardiness를 최소화하기 위한 유전자 알고리즘의 활용

  • Park, You-Jin (Department of Business Administration, College of Social Sciences, Chung-Ang University)
  • 박유진 (중앙대학교 상경학부 경영학과)
  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

본 연구는 반도체 제조공정에서 사용되는 단일 Burn-In oven에서의 Total weighted earliness와 Tardiness를 최소화하기 위한 생산 스케줄링을 결정하는 문제를 다룬다. 본 연구에서는 모든 작업은 상시에 시작가능하고 각각은 서로 다른 가중치를 가지고 있다고 가정하였다. 일반적으로 단일 Burn-In oven은 다양한 작업들이 동시에 가능한 Batch processing 기계이다. 따라서 다양한 작업들로 구성된 하나의 Batch의 Processing time은 그 Batch 내에 있는 가장 긴 Processing time을 가지는 작업에 의해 결정된다. 본 연구에서 Batch size는 미리 결정되지 않은 상황이라고 가정한 후, 최적의 Batch 개수와 작업의 순서를 결정하기 위해 유전자 알고리즘을 적용하였다. 수리적 예제를 통해서 다양한 접근방법의 성능들을 비교한 결과, 유전자 알고리즘이 Total weighted earliness와 Tardiness를 최소화하는데 가장 뛰어난 성능을 가지고 있음을 알 수 있다.

Keywords

References

  1. Azizoglu, M. and Webster, S.; "Scheduling a batch processing machine with incompatible job families," Computers and Industrial Engineering, 39, 325-335, 2001 https://doi.org/10.1016/S0360-8352(01)00009-2
  2. Baker, K. R.; Introduction to Sequencing and Scheduling, Wiley, New York, NY, 1974
  3. Baker, K. R. and Scudderb, G. R.; "Sequencing with Earliness and Tardiness Penalties : A Review," Operations Researches, 38(1), 22-36, 1990 https://doi.org/10.1287/opre.38.1.22
  4. Chandru, V., Lee, C. Y., and Uzsoy, R.; "Minimizing total completion time on a batch processing machine with job families," Operations Research Letters, 13, 61-65, 1993 https://doi.org/10.1016/0167-6377(93)90030-K
  5. Ferris, M. C. and Vlach, M.; "Scheduling with earli- ness and tardiness penalties," Naval Research Logistics Quarterly, 39, 229-245, 1992 https://doi.org/10.1002/1520-6750(199203)39:2<229::AID-NAV3220390207>3.0.CO;2-Z
  6. Garey, M. R., Tarjan, R. E., and Wilfong, G. T.; "One- Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, 13, 330-348, 1988 https://doi.org/10.1287/moor.13.2.330
  7. Goldberg, D. E.; Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing, Boston, MA, 1989
  8. Gupta, S. K. and Kyparisis, J.; "Single Machine Scheduling Research," International Journal of Management Science, 15(3), 207-227, 1987
  9. Lakshminarayan, S., Lakshmanan, R., Papineau, R. L., and Rochete, R.; "Optimal single machine scheduling with earliness and tardiness penalties," Operations Research, 26(6), 1079-1082, 1978 https://doi.org/10.1287/opre.26.6.1079
  10. Mehta, S. V. and Uzsoy, R.; "Minimizing total tardiness on a batch processing machine with incompatible job families," IIE Transactions, 30, 167-178, 1998
  11. Monch, L., Unbehaun, R. and Choung, Y. I.; "Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint," OR Spectrum, 28, 177-198, 2006 https://doi.org/10.1007/s00291-005-0013-4
  12. Ow, P. S. and Morton, T. E.; "The Single Machine Early/Tardy Problem," Management Science, 35(2), 177- 191, 1989 https://doi.org/10.1287/mnsc.35.2.177
  13. Pinedo, M.; Scheduling : Theory, Algorithms, and Systems. Prentice-Hall, NJ, 1995
  14. Sen, T. and Gupta, S. K.; A State-of-the-Art Survey of Static Scheduling Research Involving Due Dates. International Journal of Management Science, 12(1), 63-69, 1984
  15. Sidney, J.; Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. Operations Research, 25(1), 62-69, 1977 https://doi.org/10.1287/opre.25.1.62
  16. Wang, C. S. and Uzsoy, R.; "A genetic algorithm to minimize maximum lateness on a batch processing machine," Computers and Operations Research, 29 : 1621- 1640, 2002 https://doi.org/10.1016/S0305-0548(01)00031-4