작업준비시간이 없는 이종 병렬설비에서 총 소요 시간 최소화를 위한 미미틱 알고리즘 기반 일정계획에 관한 연구

서지정보

ㆍ발행기관 : 대한안전경영과학회 ㆍ수록지정보 : 대한안전경영과학회지 / 25권 / 2호
ㆍ저자명 : 이태희, 유우식

목차

Abstract
1. 서 론
1.1 서론
1.2 기존 연구와의 비교
2. 본 론
2.1 문제 상황
2.2 수리모형
2.3 규칙 기반 휴리스틱 알고리즘
2.4 탐색 기반 휴리스틱 알고리즘
3. 성능 평가 실험
3.1 실험 방법
3.2 성능 비교
4. 결 론
5. References

영어 초록

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as “makespan”. This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator’s experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

참고 자료

없음