• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Artificial Intelligence in Engineering and Technology >Automata Theory Approach for Nurse Rostering Problem
【24h】

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.
机译：自动机理论是用于捕获系统行为以及计算和解决问题的机器的抽象模型。护士排班问题（NRP）是一个众所周知的计划问题，重点是确定每个护士的日常轮班分配。我们提出一种方法来研究自动机理论的应用，该方法可以根据诊所的需求量身定制，以满足可用护士的所需工作量，从而可以满足操作需求。它特别有助于根据医疗保健组织的条件安排护士的名册。提出的解决方案说明了如何通过按顺序解析需求来唯一确定需求。输出将使用一种类型的有限状态传感器（粉状机器）生成，以分配实际的位移。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号