OPTIMASI PENJADWALAN PRODUKSI ROTI TIPE FLOWSHOP DENGAN METODE BRANCH AND BOUND
Keywords:
Production Scheduling, Flowshop, Branch and Bound, Makespan, Production Efficiency.Abstract
Production scheduling is one of the important aspects in operations management to ensure the efficiency and effectiveness of the production process. This research focuses on bread production scheduling optimization using flowshop type, where the production flow consists of stages that must be followed sequentially. The Branch and Bound method is applied to minimize the total completion time (makespan) by finding the optimal solution from various possible job sequences. The results show that this method is able to produce an optimal production schedule, by reducing idle time on machines and increasing overall productivity. A case study in a bakery industry showed a reduction in makespan time of up to 15% compared to the conventional method. This finding is expected to be a practical solution for small and medium industries (SMIs) in improving production efficiency. In addition, this research contributes to the development of science in the field of operations management, particularly in flowshop type scheduling.
References
Anderson, D., & Park, J. (2021). Advances in Scheduling Techniques for Flowshop Systems. Journal of Production Research, 29(3), 210-228.
Carter, W., & Mitchell, R. (2021). Integer Linear Programming in Industrial Applications. Computational Optimization Journal, 22(6), 480-499.
Clark, J., & White, R. (2021). Optimization Methods for Manufacturing Systems. New York: Springer.
Gupta, R., & Singh, T. (2021). Simulation-Based Optimization for Flowshop Manufacturing. International Journal of Advanced Operations, 15(4), 332-346.
Johnson, T., & Wang, L. (2021). Production Scheduling in the Era of Industry 4.0. Journal of Manufacturing Research, 15(3), 123-136.
Jones, M., & Brown, P. (2021). Branch and Bound Algorithms: Applications in Flowshop Scheduling. International Journal of Operations Research, 9(4), 250-264.
Kim, J., & Choi, Y. (2021). Implementation of Branch and Bound Algorithms in Scheduling Problems. Journal of Applied Mathematics and Computational Techniques, 33(2), 145-158.
Lee, H., & Kim, S. (2021). Flowshop Scheduling: Models and Optimization Techniques. Operations Management Review, 12(2), 145-159.
Martinez, F., et al. (2021). Case Studies in Manufacturing Optimization Using Linear Programming. Manufacturing Science Journal, 18(5), 310-325.
Morgan, L., & Sanders, K. (2021). Optimizing Manufacturing Processes Using Modern Algorithms. Engineering Operations Journal, 18(7), 275-289.
Paduloh, P., Djatna, T., Muslich, M., & Sukardi, S. (2020). Impact Of Reverse Supply Chain On Bullwhip Effects In Beef Supply. Ijscm, 9(5), 1–11. http://excelingtech.co.uk/
Smith, A., & Taylor, B. (2021). Efficient Scheduling for Small and Medium Enterprises. Journal of Industrial Engineering, 27(1), 89-102.