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

  • Silitonga R
  • Mulyono
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Silitonga, R. H. W., & Mulyono. (2023). Application of Graph Coloring in Compilation of Work Schedules for Dr. General Hospital Nurses Ferdinand Lumbantobing Sibolga. Formosa Journal of Science and Technology, 2(2), 419–432. https://doi.org/10.55927/fjst.v2i2.2856

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free