Masalah Penugasan Pada Teknisi Untuk Perbaikan Mesin Produksi Dalam Skenario Ketidakpastian
Abstract
The problem of technician assignment in terms of production machine repair is the main focus of this research to help smooth the production process, maintain the availability and performance of the machine where the repair process depends on the efficiency of the technician team. Unexpected machine damage, the level of complexity of machine repair, as well as different competencies and availability of technicians are part of the uncertainty conditions in machine repair. This research focuses on the uncertainty scenario (Sk1, Sk2, Sk3) of technician assignment for production machine repair with a case study involving 3 machines (M1, M2, M3) and 4 technicians (T1, T2, T3, T4). The method used adapts the Hurwicz and Bayes rules (H+B) where this method is designed for one-time decisions and pure strategies with the aim of minimizing the total machine repair time. The results of the application of the optimal solution method found are assignments (T1 - M1) 6.67 hours, (T2 - M2) 8.46 hours, and (T4 - M3) 7.86 hours and resulting in a minimum total repair time of 22.99 hours. Further research could be conducted to extend the model to consider different repair costs and technician capabilities as well as other approaches to uncertainty such as Fuzzy Logic or Stochastic Programming.
References
[2] M. S. Pradana dan S. A. Rohmaniah, “Penugasan Multi Objective pada Industri Konveksi di Kabupaten Lamongan,” UJMC (Unisda J. Math. Comput. Sci., vol. 10, no. 2, hal. 48–56, 2024.
[3] S. Tkatek, O. Abdoun, J. Abouchabaka, dan N. Rafalia, “A Multiple Knapsack Approach For Assignment Problem of Human Resources,” J. Theor. Appl. Inf. Technol., vol. 87, no. 3, 2016.
[4] M. Pinedo, “Scheduling: theory, algorithms, and systems springer science & business media,” LLC, 2012.
[5] D. Sipper dan R. L. Bulfin, “Production: planning, control, and integration,” (No Title), 1997.
[6] F. S. Hillier, Introduction to operations research. McGrawHill, 2005.
[7] P. A. Krokhmal dan P. M. Pardalos, “Random assignment problems,” Eur. J. Oper. Res., vol. 194, no. 1, hal. 1–17, 2009.
[8] J. M. Dhodiya dan A. R. Tailor, “Genetic algorithm based hybrid approach to solve fuzzy multi-objective assignment problem using exponential membership function,” Springerplus, vol. 5, no. 1, hal. 2028, 2016.
[9] I. N. Durbach dan T. J. Stewart, “Modeling uncertainty in multi-criteria decision analysis,” Eur. J. Oper. Res., vol. 223, no. 1, hal. 1–14, 2012.
[10] D. K. Kantu dan I. N. Durbach, “An application of portfolio decision heuristics to support the selection of research grant proposals,” ORiON, vol. 40, no. 2, hal. 109–133, 2024.
[11] H. Gaspars-Wieloch, “The assignment problem in human resource project management under uncertainty,” Risks, vol. 9, no. 1, hal. 25, 2021.
[12] L. Hurwicz, “The generalized Bayes minimax principle: a criterion for decision making under uncertainty,” Cowles Comm. Discuss. Pap. Stat, vol. 335, hal. 1950, 1951.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.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.
3.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.
