재투입이 존재하는 2단계 흐름공정에서 총 작업 흐름시간을 최소화하는 분지한계방법

• 영문명: Branch and Bound Algorithm for Two-Machine Reentrant Flowshop with the Objective of Minimizing Total Flowtime
• 발행기관: 한국산업경영시스템학회
• 저자명: 최성우(Choi Seong-Woo) 심상오(Shim Sang-Oh)
• 간행물 정보: 『산업경영시스템학회지』제33권 제4호, 1~9쪽, 전체 9쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2010.12.30

영문 초록

In this paper, we consider a two-machine re-entrant permutation flowshop scheduling problem with the objective of minimizing total flowtime, and suggest branch and bound algorithms for the scheduling problem. In this scheduling problem, each job must be processed twice on each machine, that is, each job should be processed on the two machines in the order of machine 1, machine 2 and then machine 1 and machine 2. In this research, based on the results of existing researches for re-entrant permutation flowshop scheduling problems, various dominance properties, lower bound and heuristic algorithm are suggested for the problem, and those are used to develop branch and bound algorithms. In the computational experiments for evaluation of the performance of the algorithms, the suggested branch and bound algorithms are tested on randomly generated test problems and results are reported.

목차

1. 서 론

2. 우월성질(Dominance Properties)

3. 분지한계방법(B&B Algorithm)

4. 휴리스틱(Heuristic)

5. 실험(Computational Experiments)

6. 결 론

키워드

Scheduling Re-Entrant Flowshop Branch And Bound Heuristics