Penjadwalan merupakan salah satu ma

Penjadwalan merupakan salah satu masalah yang sering dihadapi dalam mengatur penugasan dalam suatu instansi. Dalam merancang formulasi model perlu memperhatikan berbagai macam kendala terkait adanya kebijakan atau peraturan yang berlaku. Dengan adanya penjadwalan yang memenuhi syarat dan ketentuan yang ada, diharapkan mampu menciptakan jadwal yang seideal mungkin.

Meski tidak begitu rumit dari penjadwalan di universitas, masalah penjadwalan di tingkat sekolah masih menarik untuk dikaji karena dapat memberikan solusi dengan kualitas yang lebih baik. Seperti penelitian yang dilakukan oleh Birbas et al [1] yang menyelesaikan masalah penugasan shift kerja optimal dari masing-masing guru. Masalah dimodelkan menggunakan Integer Programming. Dalam penelitian Cangaiovic dan Schreuder [9] menjelaskan kasus khusus dari masalah penjadwalan guru-kelas. Kasus ini mempertimbangkan permintaan parsial antara topik dalam kurikulum dan persyaratan khusus sehubungan dengan kuliah mereka sehari-hari. Masalah dimodelkan sebagai model optimasi leksikografi diskrit yang merupakan sebuah prosedur heuristik dari pemecahan suatu masalah. Metode ini merupakan kombinasi dari dua pendekatan yang berbeda, yaitu: pada tingkat umum menggunakan pendekatan heuristik khusus untuk penjadwalan proyek dengan sumber daya terbatas dan pada tingkat harian menggunakan graph colouring. Penjadwalan pada tingkat SMA lainnnya dibahas oleh Saviniec et al [9] yang mengaplikasikan tiga algoritma Iterated Local Search (ILS) mencakup dua operator neighborhood baru yang diusulkan untuk memecahkan masalah dari literatur secara heuristik. Penelitian ini menelaah tujuh kasus. Hasil yang diperoleh menunjukkan bahwa metode ini efektif dan efisien untuk memecahkan masalah, karena metode ini mampu menemukan solusi optimal untuk semua kasus.

Hasil (Inggris) 1:

Scheduling is one of the problems often encountered in arranging assignments within an agency. In designing the model formulation needs to pay attention to various kinds of constraints related policies or regulations. With the scheduling that meets the existing terms and conditions, are expected to create a schedule that seideal possible. Though not so complicated from the scheduling, scheduling problems at school level is still interesting to be examined because it can provide the solution with a better quality. Such as research conducted by Birbas et al [1] which solve the problem of optimal working shift assignments from each teacher. Modelled using an Integer Programming problem. In the research of Cangaiovic and Schreuder [9] describes a special case of the scheduling problem of teacher-class. The case is considering a partial request between topics in the curriculum and specific requirements with respect to their daily lectures. Problems of optimization model is modelled as a discrete lexicography is a heuristic procedure of solving a problem. This method is a combination of two different approaches, namely: on the level of public use heuristic approach specific to the project scheduling with limited resources and at the level of daily use graph colouring. Scheduling on other HIGH SCHOOL level covered by Saviniec et al [9] that applied the three algorithms Iterated Local Search (ILS) includes two new neighborhood operators proposed to solve the problem of literature are heuristics. This research examines seven cases. The results obtained showed that this method is efficient and effective to solve the problem, because these methods are able to find the optimal solution for all cases.

Hasil (Inggris) 2:

Scheduling is one problem often encountered in managing the assignment within an agency. In designing the model formulation needs to consider a wide range of problems related to their policies or regulations. With the scheduling that meets the existing terms and conditions, is expected to create a schedule that is as ideal as possible.

Although not so complicated from university scheduling, scheduling issues at the school level is still interesting to study because it can provide a solution with better quality. As research conducted by Birbas et al [1] which solve the problem of optimal shift assignments from each teacher. The problem is modeled using Integer Programming. In Cangaiovic research and Schreuder [9] describes a special case of a scheduling problem-grade teacher. The case is considered a partial demand among the topics in the curriculum and special requirements in connection with their college everyday. The problem is modeled as a discrete optimization model lexicography which is a heuristic procedure of solving a problem. This method is a combination of two different approaches, namely: the general level using a special heuristic approach to project scheduling with limited resources and at a daily rate of use of graph coloring. Scheduling at the high school level lainnnya discussed by Saviniec et al [9] which applies three algorithms Iterated Local Search (ILS) includes two new neighborhood operator proposed to solve the problem of the heuristics literature. This study examined seven cases. The results showed that the method is effective and efficient way to solve the problem, because this method is able to find the optimal solution for all cases.