Perancangan Sistem Penjadwalan Mesin Hybrid Flow Shop dengan Algoritma Levyflight Discrete Firefly
DOI:
https://doi.org/10.21512/comtech.v5i2.2222Keywords:
hybrid flow shop, machine scheduling, object oriented analysis and design, levy-flight discrete firefly algorithm, makespan, latenessAbstract
The main issues that have been encountered in PT Surya Toto Indonesia is companies do not know how to measure the performance of the production process so as the utilization of resources that will be used isn’t yet to be known with efficiently. The purpose of this case studies is creating a better production processes by proposing a better and systematic scheduling information system. An Object Oriented Analysis and Design method is used to determine system’s requirements and design of the system architecture. Metaheuristic methods such as Discrete algorithms Levy-flight Firefly is used to improve the performance of the Hybrid Flow Shop machine scheduling become more better. Indicators that are used to determine the performance of the scheduling is makespan and lateness. Results from this algorithm is makespan value of 305.27 hours with lateness value of 10.92 which determine that there is no delays in scheduling. Scheduling information system was designed three primary capabilities, which are integrated data management, inventory management and a systematic and accurate scheduling system.
Plum Analytics
References
Kaban A., K., Othman, Z., & Rohmah D., Z. (2012). Comparison Of Dispatching Rules In Job-Shop Scheduling Problem Using Simulation: A Case Study. International Journal of Simulation
Modelling, 11, 129-140.
Liao, C. Jong et al. (2013). Meta-heuristics for Manufacturing Scheduling and Logistics Problems. International Journal of Production Economics, 1-3.
Marichelvam, M. K., Prabaharan, T., & Yang, X. S. (2012). A Discrete Firefly Algorithm for The Multi-Objective Hybrid Flowshop Scheduling Problems. IEEE Transactions On
Evolutionary Computation, 124.
Righi, R. d. (2012). Production Scheduling. Sao Leopoldo: InTech.
Ruiz, R., Antonio, J., & Vázquez-Rodríguez. (2009). The Hybrid Flow Shop Scheduling Problem. Nottingham: Jubilee Campus .
Satzinger, J. W., Jackson, R. B., & Burd, S. D. (2008). Systems Analysis and Design in a Changing World (5th ed.). Boston: Course Technology, CENGAGE Learning.
Sayadi, M. K., Ramezanian, R., & Ghaffari-Nasab, N. (2010). A Discrete Firefly Meta-heuristic with Local Search for Makespan Minimization in Permutation Flow Shop Scheduling Problem.
International Journal of Industrial Engineering Computations, 1-10.
Şerifoğlu, F. S., & Ulusoy, G. (2004). Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. Journal of the Operational Research Society, 55.
Yang, X. S. (2010). Firefly algorithm, L ́evy flights and global optimization. Research and Development in Intelligent Systems XXVI , 209-218.
Yang, X. S. (2010). Nature-Inspired Metaheuristic Algorithms: Second Edition. United Kingdom:
Luniver Press.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
