ANALISIS KOMPLEKSITAS MASALAH PENJADWALAN SEMINAR ILMIAH

Article Sidebar

pdf
Published: Dec 23, 2022
DOI: https://doi.org/10.24912/computatio.v6i2.21047
Keywords:
penjadwalan seminar, mathematical optimization, multiple knapsack problem
Dimensions
Altmetrics
Statistics
Read Counter : 142
Download : 122
Crossmark/ Data Version

Main Article Content

Lely Hiryanto, M.Sc.
Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Tarumanagara, Jakarta
Tony Tony
Dian Anggraini Cahyaningtyas

Abstract

Penjadwalan seminar ilmiah skala besar atau conference scheduling adalah salah satu masalah penjadwalan yang kompleks. Ada lima faktor utama yang dipertimbangkan ketika menyusun jadwal seminar ilmiah: (i) jumlah penyaji makalah, moderator dan pembicara tamu, (ii) kesediaan waktu moderator dan pembicara tamu, (iii) jumlah ruang seminar, (iv) jumlah sesi seminar dan (v) jumlah penyaji makalah yang dapat dijadwalkan dalam satu sesi seminar. Makalah ini menganalisis kompleksitas dari masalah seminar dengan mempertimbangkan kelima faktor tersebut. Analisis didasarkan pada penurunan dari tiga masalah yang telah terbukti memiliki kompleksitas Non-deterministic Polynomial Hard (NP Hard).

Article Details

Issue
Vol. 6 No. 2 (2022): Computatio: Journal of Computer Science and Information Systems
Section
Articles
Creative Commons License

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

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

Author Biography

Lely Hiryanto, M.Sc., Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Tarumanagara, Jakarta

Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Tarumanagara, Jakarta - Indonesia

References

Bulhoes, T., Correia, R. and Subramanian, A., 2022, Conference scheduling: A clustering-based approach, European Journal of Operational Research, vol. 297, no. 1, Hal. 15–26, 2022.

Martello, S. and Toth, P., 1990, Knapsack problems: algorithms and computer implementations, John Wiley & Sons, Inc.

Cacchiani, V., Iori, M., Locatelli, A. and Martello, S., 2022, Knapsack problems-an overview of recent advances. part II: Multiple, multidimensional, and quadratic knapsack problems, Computers & Operations Research, Hal. 105693.

Dell’Amico, M., Delorme, M., Lori, M. and Martello, S., 2019, Mathematical models and decomposition methods for the multiple knapsack problem, European Journal of Operational Research, vol. 274, no. 3, pp. 886–899.

Pisinger, D., 1999, An exact algorithm for large multiple knapsack problems, European Journal of Operational Research, vol. 114, no. 3, Hal. 528–541.

Agnetis, A., Coppi, A., Corsini, M., Dellino, G., Meloni, C. and Pranzo, M., 2014, A decomposition approach for the combined master surgical schedule and surgical case assignment problems, Health care management science, vol. 17, no. 1, Hal. 49–59.

Cattrysse, D. G. and Van Wassenhove, L. N., 1992, A survey of algorithms for the generalized assignment problem, European journal of operational research, vol. 60, no. 3, Hal. 260–272.

Fleszar, K., 2022, A branch-and-bound algorithm for the quadratic multiple knapsack problem, European Journal of Operational Research, vol. 298, no. 1, Hal. 89–98.

Zhou, Q., Hao, J.-K. and Wu, Q., 2022, A hybrid evolutionary search for the generalized quadratic multiple knapsack problem, European Journal of Operational Research, vol. 296, no. 3, Hal. 788–803.