바이오의약품 위탁생산 일정계획 수립을 위한 유전자 알고리즘
A Genetic Algorithm for Production Scheduling of Biopharmaceutical Contract Manufacturing Products
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
바이오의약품 위탁생산 사업(CMO)에서 다양한 고객의 주문에 대해 납기를 만족시키는 생산 일정계획을 수립하는 것은 사업이 경쟁력 측면에서 매우 중요하다. CMO 공정에서 각 주문은 다수의 배치로 구성되어 있으며 복수 개의 생산라인에 소량의 배치 단위로 할당되어 병렬 생산할 수 있다. 본 연구는 동종 병렬 설비를 보유하고 있는 CMO 공정에서 주문의 총 납기 지연을 최소화하는 일정계획을 수립하기 위한 메타휴리스틱 알고리즘을 제안한다. 제안된 알고리즘은 생물학적 진화에서 영감을 받아 염색체와 같은 데이터 구조를 무작위로 생성하여 특정 문제를 해결하며, 교차 및 돌연변이와 같은 작업을 사용하여 다양한 솔루션을 효과적으로 탐색한다. 국내 CMO 기업체에서 제공한 현업 데이터를 기반으로 컴퓨터 실험을 진행하여 제안한 알고리즘이 기업체에서 사용하고 있는 전문가 알고리즘과 상용 최적화 패키지보다 우수한 일정계획을적절한 계산시간 내에 도출하는 것을 확인하였다.
Abstract
In the biopharmaceutical contract manufacturing organization (CMO) business, establishing a production schedule that satisfies the due date for various customer orders is crucial for competitiveness. In a CMO process, each order consists of multiple batches that can be allocated to multiple production lines in small batch units for parallel production. This study proposes a meta-heuristic algorithm to establish a scheduling plan that minimizes the total delivery delay of orders in a CMO process with identical parallel machine. Inspired by biological evolution, the proposed algorithm generates random data structures similar to chromosomes to solve specific problems and effectively explores various solutions through operations such as crossover and mutation. Based on real-world data provided by a domestic CMO company, computer experiments were conducted to verify that the proposed algorithm produces superior scheduling plans compared to expert algorithms used by the company and commercial optimization packages, within a reasonable computation time.
참고문헌 (27)
- Harjunkoski, I., "Scope for industrial applications of production scheduling models and solution methods", Computers & Chemical Engineering, 62, pp.161~193 (2014)
- Pandya, E. J., "CONTRACT MANUFACTURING IN PHARMA INDUSTRY", Pharma Science Monitor, 4(3), pp.123~144 (2013)
- Rinnooy Kan, A. H. G., "Machine scheduling problems : classification, complexity and computations" (2012), Springer Science & Business Media
- Lenstra, J. K., "Complexity of scheduling under precedence constraints", Operations Research, 26(1), pp.22~35 (1978)
- Garey, M. R., "Computers and intractability", pp.37~79 (1990)
- Tahar, D. N., "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times", International journal of production economics, 99(1-2), pp.63~73 (2006)
- Eroglu, D. Y., "Mip models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines", The Scientific World Journal, 2014 (2014)
- Tutumlu, B., "A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting", Computers & Operations Research, 155, pp.106222~ (2023)
- Avgerinos, I., "Scheduling unrelated machines with job splitting, setup resources and sequence dependency", International Journal of Production Research, 61(16), pp.5502~5524 (2023)
- Liu, C., "A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints", Mathematical Problems in Engineering, pp.537127~ (2013)
- Holand, J. H., "Adaptation in Natural and Artificial Systems" (1975), University of Michigan Press
- Kumar, M., "Genetic algorithm : Review and application", SSRN, 2(2), pp.451~454 (2010)
- Muñoz, A., "Evaluating genetic algorithms through the approximability hierarchy", Journal of Computational Science, 53, pp.101388~ (2021)
- Lakhdar, K., "Multiobjective long-term planning of biopharmaceutical manufacturing facilities", Biotechnology progress, 23(6), pp.1383~1393 (2007)
- Oyebolu, F. B., "A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production", Journal of Heuristics, 23, pp.231~256 (2017)
- Sahling, F., "Dynamic lot sizing in biopharmaceutical manufacturing", International Journal of Production Economics, 207(C), pp.96~106 (2019)
- Kim, Y. D., "Parallel machine scheduling considering a job-splitting property", International Journal of Production Research, 42(21), pp.4531~4546 (2004)
- Logendran, R., "Unrelated parallel machine scheduling with job splitting", IIE Transactions, 36(4), pp.359~372 (2004)
- Eroglu, Y. D., "Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times", International Journal of Production Research, 52(19), pp.5841~5856 (2014)
- Kim, J. G., "Minimizing total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times", International Journal of Production Research, 58(6), pp.1628~1643 (2020)
- Lee, J. H., "Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints", Journal of the Operational Research Society, 72(4), pp.780~799 (2021)
- Zheng, F., "Unrelated parallel machine scheduling with processing cost, machine eligibility and order splitting", Computers & Industrial Engineering, 171, pp.108483~ (2022)
- 심재민, "바이오의약품 제조공정에서의 생산계획 최적화 모델", 석사, pp.2024
- Xing, W., "Parallel machine scheduling with splitting jobs", Discrete Applied Mathematics, 103(1-3), pp.259~269 (2000)
- Bean, J. C., "Genetic algorithms and random keys for sequencing and optimization", ORSA Journal of Computing, 6(2), pp.154~160 (1994)
- De Andrade, C. E., "Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions", Evolutionary computation, 23(2), pp.279~307 (2015)
- Gonçalves, J. F., "Biased random-key genetic algorithms for combinatorial optimization", Journal of Heuristics, 17(5), pp.487~525 (2011)