Automata Theory Approach for Nurse Rostering Problem

Automata theory is the abstract models of machines used for capturing behavior of systems as well as compute and solve problems. The nurse rostering problem (NRP) is a well-known scheduling problem that focuses on determining the day-to-day shift assignments of each nurse. We present a method to investigate the application of automata theory which can be tailored to the requirements of a clinic to satisfy the required workload to the available staff nurses so that the operational demands can be met. It specifically helps to schedule the roster of the nurses according to the conditions of the healthcare organizations. The proposed solution illustrated how the requirements are uniquely determined by parsing them through a sequence. The output will be generated using one type of finite state transducer, mealy machine to assign the actual shift.