Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획

• 영문명: Parallel Machines Scheduling with Rate-Modifying Activities to Minimize Makespan
• 발행기관: 한국산업경영시스템학회
• 저자명: 조항민(Hang-Min Cho) 임승빈(Seung-Bin Yim) 정인재(In-Jae Jeong)
• 간행물 정보: 『산업경영시스템학회지』제30권 제2호, 44~50쪽, 전체 7쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2007.06.30

영문 초록

  This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

목차

1. 서론
2. 문제 정의
3. 제안 알고리듬
4. 실험 결과
5. 결론
참고문헌

키워드

Makespan Parallel Machine Rate-modifying Activity