아웃소싱 전략을 활용하는 두 단계 흐름생산라인에서 완료시간의 총합을 최소화하는 일정계획문제

We treats a job scheduling in a 2-machine flow-shop problem with outsourcing strategy allowed. Jobs in the first machine are processed in-house or outsourced to the other companies. In this paper, all the considered jobs are determined to be in-house processed or outsourced. When a job is outsourced, then the firm should pay an outsourcing cost additionally. We want to minimize the sum of the outsourcing costs and the total completion times of finished jobs. In this paper, some solution properties are characterized, and then some heuristic algorithms and a branchand- bound solution algorithm are derived. This paper evaluates finally the performance of the proposed algorithms during the numerical tests.