ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A Scheduling Algorithm for On-Time Production in A Hybrid Flow Shop Manufacturing Process
Cited 0 time in scopus Download 2 time Share share facebook twitter linkedin kakaostory
저자
이준희, 윤영석, 박광로
발행일
201910
출처
International Conference on Information and Communication Technology Convergence (ICTC) 2019, pp.1243-1247
DOI
https://dx.doi.org/10.1109/ICTC46691.2019.8939899
협약과제
19PH2500, 지능형 신발공장을 위한 통합관리시스템 개발, 박광로
초록
In this paper, we propose a scheduling algorithm for on-time production in a hybrid flow shop manufacturing process. The main objective of our proposed algorithm is to schedule the operation of machine so as to maximize the number of machines that substitute the operation of failed machines, while satisfying the maximum allowable production time. To this end, the algorithm maximizes time interval between operations at different stages to maximize the number of substitute machines to be allocated in the time interval. Max-min optimization is employed to achieve the objective of the proposed algorithm. We compare the performance of the proposed algorithm with that of the algorithm minimizing the makespan of a schedule. Our numerical results show that the proposed algorithm improves the robustness of a manufacturing process prone to machine failure. The performance of the proposed algorithm is about three times as high as that of the algorithm minimizing the makespan in the manufacturing process, where one hundred of jobs are to be processed.
키워드
hybrid flow shop, machine failure, makespan, parallel machines, Production scheduling
KSP 제안 키워드
Different stages, Hybrid flow shop, Manufacturing processes, Numerical results, Parallel machines, Production time, Scheduling algorithm, Time interval, machine failure, max-min, production scheduling