논문 상세보기

이종 병렬설비 공정의 납기지연시간 최소화를 위한 유전 알고리즘 KCI 등재

A Genetic Algorithm for Minimizing Total Tardiness with Non-identical Parallel Machines

  • 언어KOR
  • URLhttps://db.koreascholar.com/Article/Detail/319649
구독 기관 인증 시 무료 이용이 가능합니다. 4,000원
한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)
한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)
초록

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines using GA (Genetic Algorithm). Non-identical setup times, processing times and order lot size are assumed for each machine. The GA is proposed to minimize the total-tardiness objective measure. In this paper, heuristic algorithms including EDD (Earliest Due-Date), SPT (Shortest Processing Time) and LPT (Longest Processing Time) are compared with GA. The effectiveness and suitability of the GA are derived and tested through computational experiments.

목차
1. 서 론
 2. 문제의 정의
 3. 유전알고리즘의 적용
  3.1 개체의 표현
  3.2 초기 모집단 및 적합도 평가
  3.3 선별기법 및 교차연산
  3.4 돌연변이 연산 및 교정연산
  3.5 설비할당 절차
 4. 성능 평가
 5. 결 론
 References
저자
  • 최유준(동아대학교 경영대학 경영학과) | Yu-Jun Choi Corresponding Author