인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록·키워드
This paper examines a scheduling problem in a three-machine flowshop considering outsourcing lead-time. In this problem, the initial or second operations of jobs can be processed either internally or by external subcontractors, while the third operation is required to be completed internally. Outsourcing incurs specific costs related to each operation and a lead time, which means that subsequent operations can only begin after this lead time has passed. The objective of this study is to minimize the sum of both the outsourcing costs and the total weighted completion times. Two outsourcing priority rules and three processing priority rules were proposed, leading to the development of six heuristic algorithm combinations. This research also identified several solution properties, derived a problem-specific lower bound, and introduced a branch-and-bound algorithm. Computational experiments indicate that these proposed algorithms provide both efficient and effective solutions. Future research could focus on expanding the diversity of outsourcing options. Discount rates based on the number of outsourced tasks could be incorporated into the total cost calculation, or outsourcing lead time negotiations could be treated as a variable. Additionally, factors such as the production capacity of subcontractors and delivery distances could be considered, with potential extensions to multi-machine environments.
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
UCI(KEPA) : I410-151-25-02-092095450
