처리순서기반 지수함수 학습효과를 고려한 2-에이전트 스케줄링
(주)코리아스칼라
- 최초 등록일
- 2017.01.04
- 최종 저작일
- 2013.12
- 8페이지/ 어도비 PDF
- 가격 4,000원
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 한국산업경영시스템학회
ㆍ수록지정보 : 산업경영시스템학회지 / 36권 / 4호
ㆍ저자명 : 최진영
영어 초록
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.
참고 자료
없음
"산업경영시스템학회지"의 다른 논문
더보기 (5/10)