LPT-Branch and Bound Algorithm in Flexible Flowshop Scheduling to Minimize Makespan Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan
Article Sidebar
Picture in here are illustration from public domain image or provided by the author, as part of their works
Published:
Jun 30, 2018
Keywords:
Flexible Flowshop, LPT, Branch And Bound, Maskepan
Main Article Content
Abstract
This article discussed the problem of flow shop scheduling to minimize the makespan. The purpose of this article is to develop the LPT and Branch And Bound (LPT-Branch And Bound) algorithms to minimize the makespan. The proposed method is Longest Processing Time (LPT) and Branch And Bound. Stage settlement is divided into 3 parts. To proved the proposed algorithm, a numerical experiment was conducted by comparing the LPT-LN algorithm. The result of the numerical experiment shows that LPT-Branch And Bound's proposed algorithm is more efficient than the LPT-LN algorithm.
Article Details
How to Cite
Utama, D. M. (2018). LPT-Branch and Bound Algorithm in Flexible Flowshop Scheduling to Minimize Makespan. PROZIMA (Productivity, Optimization and Manufacturing System Engineering), 2(1), 20-26. https://doi.org/10.21070/prozima.v2i1.1527
Issue
Section
Articles
Copyright (c) 2018 Dana Marsetiya Utama
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Baker, K. (1974). Introduction to sequencing and scheduling. John Wiley & Sons.
Baker, K., & Trietsch, D. (2013). Principles of sequencing and scheduling. John Wiley & Sons.
Gilmore, P., & Gomory, R. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations research, 12, 655-679.
Ginting, R. (2009). Penjadwalan Mesin. Yogyakarta: Graha Ilmu.
Harto, S., A. K. Garside, A., & Utama, D. (20166). Penjadwalan Produksi Menggunakan Algoritma Jadwal Non Delay Untuk Meminimalkan Makespan Studi Kasus di CV. Bima Mebel. Spektrum Industri, 14.
Kulcsar, G., & Erdélyi, F. (2005). Modeling and Solving of the Extended Flexible Flow Shop Scheduling Problem. Production Systems and Information Engineering, 3, 257-271.
Logendran, R., & N. Nudtasomboon, N. (1991). Minimizing the makespan of a group scheduling problem: a new heuristic,. International Journal of Production Economics, 22, 217-230.
Lomnicki, Z. (1965). A" branch-and-bound" algorithm for the exact solution of the three-machine scheduling problem. Operation Research, 89-100.
Pinedo, M. (2012). Scheduling: theory, algorithms, and systems. Springer Science & Business Media.
Sipper, D., & Bulfin, R. (1997). Production: planning, control, and integration. McGraw-Hill Science, Engineering & Mathematics.
Sriskandarajah, C., & Sethi, S. (1989). Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research, 43, 143-160.
Baker, K., & Trietsch, D. (2013). Principles of sequencing and scheduling. John Wiley & Sons.
Gilmore, P., & Gomory, R. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations research, 12, 655-679.
Ginting, R. (2009). Penjadwalan Mesin. Yogyakarta: Graha Ilmu.
Harto, S., A. K. Garside, A., & Utama, D. (20166). Penjadwalan Produksi Menggunakan Algoritma Jadwal Non Delay Untuk Meminimalkan Makespan Studi Kasus di CV. Bima Mebel. Spektrum Industri, 14.
Kulcsar, G., & Erdélyi, F. (2005). Modeling and Solving of the Extended Flexible Flow Shop Scheduling Problem. Production Systems and Information Engineering, 3, 257-271.
Logendran, R., & N. Nudtasomboon, N. (1991). Minimizing the makespan of a group scheduling problem: a new heuristic,. International Journal of Production Economics, 22, 217-230.
Lomnicki, Z. (1965). A" branch-and-bound" algorithm for the exact solution of the three-machine scheduling problem. Operation Research, 89-100.
Pinedo, M. (2012). Scheduling: theory, algorithms, and systems. Springer Science & Business Media.
Sipper, D., & Bulfin, R. (1997). Production: planning, control, and integration. McGraw-Hill Science, Engineering & Mathematics.
Sriskandarajah, C., & Sethi, S. (1989). Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research, 43, 143-160.