Application of Graph Coloring in Compilation of Work Schedules for Dr. General Hospital Nurses Ferdinand Lumbantobing Sibolga

Rifka Helena W Silitonga; Mulyono

doi:10.55927/fjst.v2i2.2856

Authors

Rifka Helena W Silitonga Universitas Negeri Medan
Mulyono Universitas Negeri Medan

DOI:

https://doi.org/10.55927/fjst.v2i2.2856

Keywords:

Scheduling, Graph, Graph Coloring, Welch-Powell Algorithm

Abstract

Preparation of a schedule is needed to regulate the course of work activities, but errors often occur such as schedules that are not according to the rules and schedules that clash, for that we need other alternatives that can help the process of preparing the schedule. An alternative that can be used is Graph Coloring. Graph coloring is the process of giving color to graph nodes so that no neighboring vertices have the same color, the vertices represent the nurses and the edges represent the relationships between nurses. Then coloring the graph nodes with the Welch-Powell algorithm, where each neighboring (related) vertex is not colored with the same color so that nurses with the same criteria have different groups. So that each working group of nurses formed has nurses with each criterion according to predetermined rules and there are no conflicting schedules.

Downloads

Download data is not yet available.

References

Balakrishnan dan Ranganathan. (2012). A Textbook of Graph Theory Second Edition. New York: Springer.

Bondy, J. A & Murty, U. S. R. (1982). Graph Theory with Application. New York: Elsevier Science Publishing Co., Inc.

Clark, J & Holton, D. A. (1995). A First Look at Graph Theory. Singapore: World Scientific Publishing Co., Inc.

Cormen, Thomas H., dkk. (2009). Introduction to Algorithms Thrid Edition. London: Massachusetts.

Daniel, Farida & Taneo, Prida N. L. (2019). Teori Graf. Yogyakarta: Deepublish.

Ferland Kevin. (2009). Discrete Mathematics an Introduction to Proofs and Combinatorics. New York: Houghton Mifflin Company.

Ganguli, Runa & Roy, Siddhartha. (2017). A Study on Course Timetable Scheduling using Graph Coloring Approach. Journal of Computational and Applied Mathematics.12(2): 469-485.

Goodaire, Edgar G dan Parmenter, Michael M. (2006). Discrete Marhematics with Graph Theory Third Edition. New Delhi: Prentice-Hall, Inc.

Koshy, Thomas. (2004). Discrete Mathematics with Application. USA: Elsevier Academic Press

Lewis, R.M.R. (2016). A Guide to Graph Colouring Algorithms and Applications. New York: Springer

Liu, C.L & Mohapatra D. P. (2008). Elements of Discrete Mathematics a Computer Orlented Approach Third Edition. New York: The McGrow-Hill Companies

Marsudi. (2016). Teori Graf. Malang: UB Press

Meiliana, Cahyo H dan Maryono, Dwi. (2014). Aplikasi Pewarnaan Graf untuk Optimalisasi Pengaturan Traffic Light di Sukoharjo. Jurnal JIPTEK. 7(1): 25-34

Munir, Rinaldi. (2003). Matematika Diskrit. Bandung: Informatika Bandung

Pinedo, Michael L. (2008). Scheduling Theory, Algorithms and Systems. New York: Springer.

Rosen, Kenneth H. (2019). Discrete Mathematics and Its Aplication Eight Edition. New York: McGraw Hill Education.

Rusdiana, Yulianti. & Maulani, Alfi. (2019). Algoritma Welch-Powell untuk Pewarnaan Graf Pada Penjadwalan Perkuliahan. Science and Phsics Education Journal. Vol.3, No 1, 37-47.

Siang, Jong Jek.(2009). Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta: Penerbit Andi.

Syaifuddin, Y. W., dkk. (2017). Matematika Diskrit. Malang: Polinema Press.

Wahyuningrum, T & Usada, E. (2019). Matematika Diskrit dan Penerapannya dalam Dunia Informasi.Yogyakarta: Deepublish.

Wilson, Robin J. (2010). Introduction to Graph Theory Fifth Edition.. London: Pearson.

Yusnita, Amelia. & dkk. (2019). Penerapan Metode Pewarnaan Graf untuk Penjadwalan Mata Kuliah. Jurnal Media Informatika Budidarma. 3(3): 153-158.