처리순서기반 지수함수 학습효과를 고려한 2-에이전트 스케줄링

• 영문명: Two-Agent Scheduling with Sequence-Dependent Exponential Learning Effects Consideration
• 발행기관: 한국산업경영시스템학회
• 저자명: 최진영(Jin Young Choi)
• 간행물 정보: 『산업경영시스템학회지』제36권 제4호, 130~137쪽, 전체 7쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2013.12.31

영문 초록

In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

목차

Abstract

1. 서론

2. 문제 정의

3. 열거기반 역방향 할당 스케줄링

4. 수치 예제

5. 결론

Acknowledgement

References

키워드

Two-Agent Scheduling Sequence-Dependent Exponential Learning Effect Makespan Total Completion Time Learning Ratio Backward Allocation Scheduling