Byung Soo Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Byung Soo Kim has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Asif Iqbal Malik
KFUPM
3 shared publications Cheol Min Joo
Division of Mechatronics Engineering, Dongseo University
3 shared publications- Seung Jae Lee
Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea
3 shared publications - Yong Jae Kim
Department of Industrial and Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea
3 shared publications Yong Jae Kim
Department of Industrial and Management Engineering, Incheon National University, Incheon, Republic of Korea
2 shared publicationsYoung-Bin Woo
2 shared publications
Latest Publications
- Open Access
- 19 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 1044
Population-Based Metaheuristic Algorithms for a Hybrid Batch-Continuous Production Scheduling Problem in a Distributed Pharmaceutical Supply Chain
We study a pharmaceutical scheduling problem with a hybrid batch-continuous manufacturing process in a distributed supply chain. The supply chain consists of heterogeneous plants and one distribution center. Each plant adopts an unrelated permutation flowshop layout consisting of a hybrid batch-continuous production line. Each pharmaceutical order is split and produced in multi-production sites located in various regions. The pharmaceutical medicines manufactured by the production sites are directly shipped to a distribution center. To minimize the makespan, we formulate the addressed scheduling problem as a mathematical model. To solve this model, we propose four metaheuristic variants by applying two population-based metaheuristics to two distinct solution structures. We compare the proposed metaheuristics to evaluate their performance in the numerical experiments. Additionally, we present managerial insights through sensitivity analysis.
- 19 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 1044
Open AccessPopulation-Based Metaheuristic Algorithms for a Hybrid Batch-Continuous Production Scheduling Problem in a Distributed Pharmaceutical Supply Chain
We study a pharmaceutical scheduling problem with a hybrid batch-continuous manufacturing process in a distributed supply chain. The supply chain consists of heterogeneous plants and one distribution center. Each plant adopts an unrelated permutation flowshop layout consisting of a hybrid batch-continuous production line. Each pharmaceutical order is split and produced in multi-production sites located in various regions. The pharmaceutical medicines manufactured by the production sites are directly shipped to a distribution center. To minimize the makespan, we formulate the addressed scheduling problem as a mathematical model. To solve this model, we propose four metaheuristic variants by applying two population-based metaheuristics to two distinct solution structures. We compare the proposed metaheuristics to evaluate their performance in the numerical experiments. Additionally, we present managerial insights through sensitivity analysis.
- Open Access
- 13 March 2026
- Published by MDPI AG in Preprints.org
Population-Based Metaheuristic Algorithms for a Hybrid Batch-Continuous Production Scheduling Problem in a Distributed Pharmaceutical Supply Chain
We study a pharmaceutical scheduling problem with hybrid batch-continuous manufacturing process in a distributed supply chain. The supply chain consists of heterogeneous plants and one distribution center. Each plant adopts an unrelated permutation flow shop layout consisting of a hybrid batch-continuous production line. Each pharmaceutical order is split and produced in multi-production sites located in various regions. The pharmaceutical medicines manufactured by the production sites are directly shipped to a distribution center To minimize the makespan, we formulate the addressed scheduling problem as a mathematical model. To solve this model, we propose four metaheuristics variants by applying two population-based metaheuristics to two distinct solution structures. We compare the proposed metaheuristics to evaluate their performance in the numerical experiments. Additionally, we present managerial insights through sensitivity analysis.
- 13 March 2026
- Published by MDPI AG in Preprints.org
Open AccessPopulation-Based Metaheuristic Algorithms for a Hybrid Batch-Continuous Production Scheduling Problem in a Distributed Pharmaceutical Supply Chain
We study a pharmaceutical scheduling problem with hybrid batch-continuous manufacturing process in a distributed supply chain. The supply chain consists of heterogeneous plants and one distribution center. Each plant adopts an unrelated permutation flow shop layout consisting of a hybrid batch-continuous production line. Each pharmaceutical order is split and produced in multi-production sites located in various regions. The pharmaceutical medicines manufactured by the production sites are directly shipped to a distribution center To minimize the makespan, we formulate the addressed scheduling problem as a mathematical model. To solve this model, we propose four metaheuristics variants by applying two population-based metaheuristics to two distinct solution structures. We compare the proposed metaheuristics to evaluate their performance in the numerical experiments. Additionally, we present managerial insights through sensitivity analysis.
- Open Access
- 6 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (5) , 877
An Optimization Problem of Distributed Permutation Flowshop Scheduling with an Order Acceptance Strategy in Heterogeneous Factories
This paper addresses a distributed permutation flowshop scheduling problem with an order acceptance strategy in heterogeneous factories. Each order has a related revenue and due date, and several flowshop machines are operated in each factory, and they have a distinct sequence-dependent setup time. We select/reject production orders, assign the selected orders to the factories, and determine the permutation manufacturing sequence in each factory to maximize the total profit. To optimally solve the scheduling problem, we formulate the scheduling problem as a mixed integer linear programming model to find an optimal solution for small-sized experiments. Then, we propose two population-based algorithms, a genetic algorithm and particle swarm optimization for large-sized experiments. We proved that the proposed genetic algorithm effectively and efficiently solves the problem to guarantee a near optimal solution through computational experiments. Finally, we conduct a sensitivity analysis of the genetic algorithm to observe the relationship between order selection, revenue, and order tardiness cost.
- 6 March 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (5) , 877
Open AccessAn Optimization Problem of Distributed Permutation Flowshop Scheduling with an Order Acceptance Strategy in Heterogeneous Factories
This paper addresses a distributed permutation flowshop scheduling problem with an order acceptance strategy in heterogeneous factories. Each order has a related revenue and due date, and several flowshop machines are operated in each factory, and they have a distinct sequence-dependent setup time. We select/reject production orders, assign the selected orders to the factories, and determine the permutation manufacturing sequence in each factory to maximize the total profit. To optimally solve the scheduling problem, we formulate the scheduling problem as a mixed integer linear programming model to find an optimal solution for small-sized experiments. Then, we propose two population-based algorithms, a genetic algorithm and particle swarm optimization for large-sized experiments. We proved that the proposed genetic algorithm effectively and efficiently solves the problem to guarantee a near optimal solution through computational experiments. Finally, we conduct a sensitivity analysis of the genetic algorithm to observe the relationship between order selection, revenue, and order tardiness cost.
- Open Access
- 31 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (3) , 485
Population-Based Search Algorithms for Biopharmaceutical Manufacturing Scheduling Problem with Heterogeneous Parallel Mixed Flowshops
In this paper, we address biopharmaceutical manufacturing scheduling problems with heterogeneous parallel mixed flowshops. The mixed flowshop consists of three stages, one batch process and two continuous processes. The objective function is to minimize the total tardiness. We formulated a mixed-integer linear programming model for the problem to obtain optimal solutions to small-size problems. We present a genetic algorithm and particle swarm optimization, which are used to find efficient solutions for large-size problems. We show that the particle swarm optimization outperforms the genetic algorithm in large-size problems. We conduct a sensitivity analysis to obtain managerial insights using the particle swarm optimization algorithm.
- 31 January 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (3) , 485
Open AccessPopulation-Based Search Algorithms for Biopharmaceutical Manufacturing Scheduling Problem with Heterogeneous Parallel Mixed Flowshops
In this paper, we address biopharmaceutical manufacturing scheduling problems with heterogeneous parallel mixed flowshops. The mixed flowshop consists of three stages, one batch process and two continuous processes. The objective function is to minimize the total tardiness. We formulated a mixed-integer linear programming model for the problem to obtain optimal solutions to small-size problems. We present a genetic algorithm and particle swarm optimization, which are used to find efficient solutions for large-size problems. We show that the particle swarm optimization outperforms the genetic algorithm in large-size problems. We conduct a sensitivity analysis to obtain managerial insights using the particle swarm optimization algorithm.
- 11 July 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 164
Vehicle routing and scheduling problem with order acceptance for pharmaceutical refrigerated logistics
- 11 July 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 164
Vehicle routing and scheduling problem with order acceptance for pharmaceutical refrigerated logistics
- Open Access
- 4 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (21) , 4127
Population-Based Meta-Heuristic Algorithms for Integrated Batch Manufacturing and Delivery Scheduling Problem
This paper addresses an integrated scheduling problem of batch manufacturing and delivery processes with a single batch machine and direct-shipping trucks. In the manufacturing process, some jobs in the same family are simultaneously processed as a production batch in a single machine. The batch production time depends only on the family type assigned to the production batch and it is dynamically adjusted by batch deterioration and rate-modifying activities. Each job after the batch manufacturing is reassigned to delivery batches. In the delivery process, each delivery batch is directly shipped to the corresponding customer. The delivery time of delivery batches is determined by the distance between the manufacturing site and customer location. The total volume of jobs in each production or delivery batch must not exceed the machine or truck capacity. The objective function is to minimize the total tardiness of jobs delivered to customers with different due dates. To solve the problem, a mixed-integer linear programming model to find the optimal solution for small problem instances is formulated and meta-heuristic algorithms to find effective solutions for large problem instances are presented. Sensitivity analyses are conducted to find the effect of problem parameters on the manufacturing and delivery time.
- 4 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (21) , 4127
Open AccessPopulation-Based Meta-Heuristic Algorithms for Integrated Batch Manufacturing and Delivery Scheduling Problem
This paper addresses an integrated scheduling problem of batch manufacturing and delivery processes with a single batch machine and direct-shipping trucks. In the manufacturing process, some jobs in the same family are simultaneously processed as a production batch in a single machine. The batch production time depends only on the family type assigned to the production batch and it is dynamically adjusted by batch deterioration and rate-modifying activities. Each job after the batch manufacturing is reassigned to delivery batches. In the delivery process, each delivery batch is directly shipped to the corresponding customer. The delivery time of delivery batches is determined by the distance between the manufacturing site and customer location. The total volume of jobs in each production or delivery batch must not exceed the machine or truck capacity. The objective function is to minimize the total tardiness of jobs delivered to customers with different due dates. To solve the problem, a mixed-integer linear programming model to find the optimal solution for small problem instances is formulated and meta-heuristic algorithms to find effective solutions for large problem instances are presented. Sensitivity analyses are conducted to find the effect of problem parameters on the manufacturing and delivery time.
- Open Access
- 20 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (4) , 657
A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities
This paper addresses a batch loading and scheduling problem of minimizing the makespan on parallel batch processing machines. For batch loading, jobs with compatible families can be assigned to the same batch process even if they differ in size; however, batches can only be formed from jobs within the same family, and the batch production time is determined by the family. During the batch scheduling, the deterioration effects are continuously added to batches processed in each parallel machine so that the batch production times become deteriorated. The deteriorated processing time of batches can be recovered to the original processing times of batches by a maintenance or cleaning process of machines. In this problem, we sequentially determine the batching of jobs and the scheduling of batches. Due to the complexity of the problem, we proposed a three-stage ant colony optimization algorithm. The proposed algorithm found an optimal solution for small-sized problems and achieved near-optimal solutions and better performance than a genetic algorithm or a particle swarm optimization for large-sized problems.
- 20 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (4) , 657
Open AccessA Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities
This paper addresses a batch loading and scheduling problem of minimizing the makespan on parallel batch processing machines. For batch loading, jobs with compatible families can be assigned to the same batch process even if they differ in size; however, batches can only be formed from jobs within the same family, and the batch production time is determined by the family. During the batch scheduling, the deterioration effects are continuously added to batches processed in each parallel machine so that the batch production times become deteriorated. The deteriorated processing time of batches can be recovered to the original processing times of batches by a maintenance or cleaning process of machines. In this problem, we sequentially determine the batching of jobs and the scheduling of batches. Due to the complexity of the problem, we proposed a three-stage ant colony optimization algorithm. The proposed algorithm found an optimal solution for small-sized problems and achieved near-optimal solutions and better performance than a genetic algorithm or a particle swarm optimization for large-sized problems.
- 3 December 2021
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 119 (3-4) , 2247-2258
Part-grouping and build-scheduling with sequence-dependent setup time to minimize the makespan for non-identical parallel additive manufacturing machines
- 3 December 2021
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 119 (3-4) , 2247-2258
Part-grouping and build-scheduling with sequence-dependent setup time to minimize the makespan for non-identical parallel additive manufacturing machines
- 20 October 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (2) , 1109-1150
Coordination supply chain management under flexible cleaner production system and stochastic conditions
- 20 October 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (2) , 1109-1150
Coordination supply chain management under flexible cleaner production system and stochastic conditions
- 1 October 2021
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 160, 107558
Production-Inventory control model for a supply chain network with economic production rates under no shortages allowed
- 1 October 2021
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 160, 107558
Production-Inventory control model for a supply chain network with economic production rates under no shortages allowed