OPTIMALISASI PENJADWALAN PROSES PRODUKSI BERBASIS PROGRAM KOMPUTER

  • Jeffry Susanto Universitas Bina Nusantara
  • Ngarap Imanuel Manik Mathematics Department, SOCS, Bina Nusantara University Jakarta
DOI: https://doi.org/10.52362/jisamar.v7i2.1058

Abstract

Penjadwalan merupakan salah satu masalah yang penting dalam suatu sistem produksi.  Pembentukan jadwal yang optimal untuk  proses produksi cukup sulit dan membutuhkan waktu perhitungan yang cukup lama, sehingga diperlukan bantuan program Komputer untuk menyelesaikan masalah penjadwalan tersebut. Makalah ini membahas tentang optimalisasi penyelesaian penjadwalan proses produksi dengan menggunakan bantuan program komputer Algoritma Relaksasi Lagrange. Adapun tahapan yang dilakukan adalah pada awal masalah diselesaikan pada tingkatan job dengan pemrograman dinamis lalu dengan menggunakan metode subgradien memperbarahui nilai pengali lagrange. Hasil menunjukkan bahwa penjadwalan proses produksi yang didapat melalui tahapan-tahapan ini merupakan penjadwalan yang optimal.

Downloads

Download data is not yet available.

References

[1] Rius-Sorolla G1 , Maheut J, “Lagrangian relaxation of the Generic Materials and Operations Planning model”, Central European Journal of Operations Research. 28, 2020, pp105-123.
[2] Michael. “Scheduling : theory, algorithms, and systems”, 4nd Edition Prentice Hall, Springer, 2013
[3] Allahverdi, Ali. “A Survey of Scheduling Problems with No-Wait in Process: A Survey of Scheduling Problems with No-Wait in Process.” European Journal of Operational Research 255, no. 3, Elsevier (2016): pp.665–86.

[4] Le Hai Yen, Le Dung Muu,“A subgradient method for equilibrium problems involving quasiconvex bifunctions”, Operations Research Letters, Volume 48, 5, 2020, Pages 579-583
[5] Yaohua Hu, et all, “A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems”, Numerical Functional Analysis and Optimization, Volume 36,12, 2015, pp 1559-1584
[6] Sommerville, Ian., Software Engineering. 10thEdition. Pearson Publisher, Canada, 2015
[7] Jian-YaDing, ShijiSong, Jatinder N.D.Gupta at all, ”An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem”, Applied Soft Computing Volume 30, 2015, Pages 604-613
[8] Peter B. Luh, Xing Zhao, Yajun Wang, and Lakshman S. Thakur ,“Lagrangian Relaxation Neural Networks for Job Shop Scheduling”, IEEE Transactions on Robotics and Automation, Vol. 16, No. 1, 2000, pp 78-88.
[9] Sapkal, S.U. Laha, D., and J.N.D. Gupta. “A Penalty-Shift-Insertion Based Algorithm to Minimize Total Flow Time in No-Wait Flow Shops.” Journal of the Operational Research Society 65, no. 10, Elsevier (2014),pp11–24.
[10] Ding, Jian-Ya, Shiji Song, Jatinder ND Gupta, Rui Zhang, Raymond Chiong, and Cheng Wu. "An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem." Applied Soft Computing 30, Elsevier (2015):pp. 604-613.
[11] Suprayogi , Valentine, “ Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dgn Penggunaan Sumberdaya Simultan”, Jurnal Teknik Industri, Vol. 17, No. 2, (2015), pp 71-80
Published
2023-05-06
How to Cite
SUSANTO, Jeffry; MANIK, Ngarap Imanuel. OPTIMALISASI PENJADWALAN PROSES PRODUKSI BERBASIS PROGRAM KOMPUTER. Journal of Information System, Applied, Management, Accounting and Research, [S.l.], v. 7, n. 2, p. 280-288, may 2023. ISSN 2598-8719. Available at: <https://journal.stmikjayakarta.ac.id/index.php/jisamar/article/view/1058>. Date accessed: 28 apr. 2025. doi: https://doi.org/10.52362/jisamar.v7i2.1058.
Citation Formats
Issue
Vol 7 No 2 (2023): JISAMAR : May 2023
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.