{"id":"https://openalex.org/W4406162007","doi":"https://doi.org/10.70340/jirsi.v3i3.168","title":"Penjadwalan Mata Kuliah Otomatis Menggunakan Algoritma Late Acceptance Hill-Climbing Hyper-Heuristics dengan Domain Permasalahan ITC","display_name":"Penjadwalan Mata Kuliah Otomatis Menggunakan Algoritma Late Acceptance Hill-Climbing Hyper-Heuristics dengan Domain Permasalahan ITC","publication_year":2024,"publication_date":"2024-09-30","ids":{"openalex":"https://openalex.org/W4406162007","doi":"https://doi.org/10.70340/jirsi.v3i3.168"},"language":"id","primary_location":{"id":"doi:10.70340/jirsi.v3i3.168","doi":"https://doi.org/10.70340/jirsi.v3i3.168","is_oa":true,"landing_page_url":"https://doi.org/10.70340/jirsi.v3i3.168","pdf_url":"https://jurnal.unity-academy.sch.id/index.php/jirsi/article/download/168/132","source":{"id":"https://openalex.org/S4404663103","display_name":"Jurnal Ilmu Komputer dan Sistem Informasi.","issn_l":"2830-3954","issn":["2830-3954","2830-6031"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Ilmu Komputer dan Sistem Informasi","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://jurnal.unity-academy.sch.id/index.php/jirsi/article/download/168/132","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067320303","display_name":"Cut Alna Fadhilla","orcid":"https://orcid.org/0000-0002-9534-2980","observed_orcids":["https://orcid.org/0000-0002-9534-2980"]},"institutions":[{"id":"https://openalex.org/I3129979466","display_name":"Samudra University","ror":"https://ror.org/01gpyzk95","country_code":"ID","type":"education","lineage":["https://openalex.org/I3129979466"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Cut Alna Fadhilla","raw_affiliation_strings":["Universitas Samudra"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitas Samudra","institution_ids":["https://openalex.org/I3129979466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067320303"],"corresponding_institution_ids":["https://openalex.org/I3129979466"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"3","first_page":"243","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/course-scheduling","display_name":"course scheduling","score":0.9089999794960022},{"id":"https://openalex.org/keywords/late-acceptance-hill-climbing","display_name":"late acceptance hill climbing","score":0.7350000143051147},{"id":"https://openalex.org/keywords/hyper-heuristics","display_name":"hyper-heuristics","score":0.9900000095367432},{"id":"https://openalex.org/keywords/np-hard-scheduling-problems","display_name":"NP-hard scheduling","score":0.5899999737739563},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.6499999761581421}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6270595192909241},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.497409850358963},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.46807894110679626},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4468633532524109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11947396397590637},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.70340/jirsi.v3i3.168","doi":"https://doi.org/10.70340/jirsi.v3i3.168","is_oa":true,"landing_page_url":"https://doi.org/10.70340/jirsi.v3i3.168","pdf_url":"https://jurnal.unity-academy.sch.id/index.php/jirsi/article/download/168/132","source":{"id":"https://openalex.org/S4404663103","display_name":"Jurnal Ilmu Komputer dan Sistem Informasi.","issn_l":"2830-3954","issn":["2830-3954","2830-6031"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Ilmu Komputer dan Sistem Informasi","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.70340/jirsi.v3i3.168","doi":"https://doi.org/10.70340/jirsi.v3i3.168","is_oa":true,"landing_page_url":"https://doi.org/10.70340/jirsi.v3i3.168","pdf_url":"https://jurnal.unity-academy.sch.id/index.php/jirsi/article/download/168/132","source":{"id":"https://openalex.org/S4404663103","display_name":"Jurnal Ilmu Komputer dan Sistem Informasi.","issn_l":"2830-3954","issn":["2830-3954","2830-6031"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jurnal Ilmu Komputer dan Sistem Informasi","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4406162007.pdf","grobid_xml":"https://content.openalex.org/works/W4406162007.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W2061447389","https://openalex.org/W2072441740","https://openalex.org/W2899763619","https://openalex.org/W2943115740","https://openalex.org/W2967783393","https://openalex.org/W3086836212","https://openalex.org/W4200498607","https://openalex.org/W4205848994","https://openalex.org/W4308896274","https://openalex.org/W4321766278","https://openalex.org/W4381611434","https://openalex.org/W4395083203","https://openalex.org/W4396233551","https://openalex.org/W4404421294"],"related_works":["https://openalex.org/W3173949834","https://openalex.org/W2906600350","https://openalex.org/W2938910416","https://openalex.org/W3092417329","https://openalex.org/W1600425676","https://openalex.org/W2789175895","https://openalex.org/W2941759306","https://openalex.org/W4378232804","https://openalex.org/W2624829408","https://openalex.org/W7220303904"],"abstract_inverted_index":{"Permasalahan":[0],"penjadwalan":[1,39,62,132,151,174,221],"mata":[2,40,63,82,92,133,152,175,194,201,222],"kuliah":[3,64,83,93,134,176,195,202,223],"merupakan":[4],"topik":[5],"yang":[6,23,34,43,52,73,86,98,108,116,145,168,185,199,207,230],"sangat":[7],"menarik":[8],"untuk":[9,37,57,70,128,148,171,218],"diselesaikan":[10],"dikarenakan":[11],"termasuk":[12],"salah":[13,154],"satu":[14],"permasalahan":[15,38,61,81,131,150,173,220,226],"NP-hard,":[16],"dimana":[17],"belum":[18],"ada":[19],"algoritma":[20,144,157,235],"konvensional":[21],"eksak":[22],"mampu":[24],"menyelesaikannya":[25],"dalam":[26,54,122],"waktu":[27,95],"polinomial.":[28],"International":[29,66,180,227],"Timetabling":[30,67,181,228],"Competition":[31,68,229],"adalah":[32,69,90,103,156,191],"kompetisi":[33],"diadakan":[35,45],"khusus":[36],"kuliah.":[41],"Kompetisi":[42],"sudah":[44],"keempat":[46],"kalinya":[47],"ini":[48,167,190],"terus":[49],"memberikan":[50],"tantangan":[51,121],"berbeda":[53],"penyelesaian":[55,130,219],"masalah":[56,124],"mendapatkan":[58],"solusinya.":[59],"Tujuan":[60],"pada":[65,75,94],"meminimalkan":[71],"biaya":[72],"dikeluarkan":[74],"semua":[76],"konten":[77],"permasalahan.":[78],"Terdapat":[79,142],"dua":[80],"secara":[84],"umum":[85],"akan":[87,119,169],"diselesaikan.":[88],"Pertama":[89],"menjadwalkan":[91],"dan":[96,101,196],"ruang":[97],"telah":[99,109,135,208],"disediakan":[100],"kedua":[102],"membagi":[104],"mahasiswa":[105,198],"kepada":[106],"kelas-kelas":[107],"terjadwal.":[110],"Selain":[111],"itu":[112],"terdapat":[113],"pula":[114],"batasan":[115],"harus":[117],"dipenuhi":[118],"menjadi":[120,216],"menyelesaikan":[123,149,172],"ini.":[125],"Beberapa":[126],"penelitian":[127,189],"melakukan":[129],"dilakukan":[136],"dengan":[137,162,204,232],"menggunakan":[138,163,177],"berbagai":[139],"macam":[140],"algoritma.":[141],"beberapa":[143],"dapat":[146,215],"digunakan":[147],"kuliah,":[153],"satunya":[155],"Late":[158],"acceptance":[159],"hill":[160],"climbing":[161],"pendekatan":[164],"Hyper-heuristics.":[165],"Algoritma":[166],"dipilih":[170],"dataset":[178],"dari":[179,187,212,224,234],"Competition.":[182],"Hasil":[183],"luaran":[184,213],"diharapkan":[186],"pengerjaan":[188],"daftar":[192,197],"jadwal":[193],"mengambil":[200],"tersebut":[203,214],"memenuhi":[205],"batasan-batasan":[206],"ditetapkan":[209],"sehingga":[210],"hasil":[211,233],"solusi":[217],"domain":[225],"kompetitif":[231],"benchmark.":[236]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2025-01-09T00:00:00"}