병렬설비를 가지는 열처리공정에서의 배치일정계획 수립 연구
The Batch Scheduling for Heat-Treatment Process with Parallel Machines Environments
0
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
본 연구는 금속제품 생산 프로세스의 처리능력을 결정하는 주요 공정인 열처리 공정의 생산계획을 수립하는 것이다. 열처리로 전체의 작업완료시간(makespan)을 최소화하기 위한 유전알고리즘을 제시하는 것을 본 연구의 목표로 한다. 일반적인 유전알고리즘의 각 단계에서 해의 가능성을 만족하기 위해 ‘재할당 절차’를 통해 알고리즘의 적용을 유효하게 하였고, SPT 규칙을 기초로 한 FFD 방법론을 활용하여 각 열처리로 별로 세부 일정계획을 수립하였다. 이러한 절차를 통해 효과적인 해를 찾을 수 있도록 하였으며, 유전알고리즘 해와 비교를 위해 하한값을 제시하였다. 제시된 유전알고리즘의 성능을 분석하기 위해 성능평가를 실시하였다.
Abstract
This paper considers a batch scheduling problem for heat-treatment process with parallel machine environments. To derive efficient and effective solutions for the targeted problem, this paper considers the genetic algorithm to minimize the makespan objective measure. To satisfy the feasibility of the solutions provided by the GA algorithm, this paper derives some solution properties and procedures, such as 'relocation procedure' etc. In addition, using SPT rule based FFD methodology, detailed schedules are established at each heat treatment. To show the effectiveness of the solutions by GA algorithm, some lower bounds are also derived. The computational experiments are conducted to test the performance of the derived GA algorithm.
참고문헌 (12)
- 장재원, "제한된 Bin Packing Problem 의 유전자알고리즘 해법", 산학협력기술연구논문집, 4, pp.265~270 (1998)
- Ali Husseinzadeh Kashan, "A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes", Computers & Operations Research, 35, pp.1084~1098 (2008)
- Coffman, E. G., "An application of bin-packing to multimachine scheduling", SIAM Journal of Computing, 7, pp.1~17 (1978)
- Dobson, G., "The batch loading and scheduling problem", Operations Research, 49, pp.52~65 (2001)
- Dyckhoff, H., "A Typology of Cutting and Packing Problems", European Journal of Operational Research, 144, pp.145~159 (1990)
- Jatinder N. D. G., "A new heuristic algorithm for the onedimensional bin-packing problem", Production Planning & Control, 10(6), pp.598~603 (1999)
- Krzysztof F., "New heuristics for one-dimensional bin-packing", Computer & Operations Research, 29, pp.821~839 (2002)
- Lars Mönch, "Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times", Computers & Operations Research, 32, pp.2731~2750 (2005)
- Lee, C. Y., "Minimizing makespan on a single batch processing machine with dynamic job arrivals", International Journal of Production Research, 37, pp.219~236 (1999)
- Koh, Shie-Gheun, "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families", INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 98, pp.81~96 (2005), ELSEVIER SCIENCE BV
- Koh, Shie-Gheun, "Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families", International Journal of Production Research, 42(19), pp.4091~4107 (2004)
- Vijaya Chandru, "Minimizing total completion time on a batch processing machine with job families", Operations Research Letters, 13, pp.61~65 (1993)