Part-mix allocation in a hybrid manufacturing system with a flexible manufacturing cell and a conventional jobshop
We consider a part-mix allocation problem in a hybrid manufacturing system (HMS) composed of a flexible manufacturing cell (FMC) and a conventional jobshop with the objective of minimizing makespan. The problem is to find the best part-mix allocation to the FMC and the conventional jobshop for a given set of part types to be produced during the upcoming planning horizon. For the problem, we should solve the jobshop and the FMC scheduling problems for each part-mix allocation alternative. Because of the computational difficulty of each of the scheduling problems, we use heuristics: list scheduling method for the jobshop scheduling problem and a part grouping algorithm called the maximal intersection minimal union heuristic for the FMC scheduling problem. Then, for the entire part-mix allocation problem, we develop a branch and fathoming algorithm that uses the two scheduling heuristics. These algorithms, when combined, give a good part-mix allocation and production schedules in the FMC and the conventional jobshop at the same time. Computational results show that the branch and fathoming algorithm requires much shorter computation time than a full enumeration method and can solve problems of a practical size in a reasonable amount of time.(Author abstract)
- 원문이 없습니다.
유료 다운로드의 경우 해당 사이트의 정책에 따라 신규 회원가입, 로그인, 유료 구매 등이 필요할 수 있습니다. 해당 사이트에서 발생하는 귀하의 모든 정보활동은 NDSL의 서비스 정책과 무관합니다.
NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.
- 이 논문과 함께 출판된 논문 + 더보기