Weekly scheduling models for traveling therapists

This paper presents a series of models that can be used to find weekly schedules for therapists who provide ongoing treatment to patients throughout a geographical region. In all cases, patient-appointment times and visit days are known prior to the beginning of the planning horizon. Variations in the models include single vs. multiple home bases, homogeneous vs. heterogeneous therapists, lunch break requirements, and a nonlinear cost structure for mileage reimbursement and overtime. The single home base and homogeneous therapist cases proved to be easy to solve and so were not thoroughly investigated. This left two cases of interest: the first included only lunch breaks while the second added nonlinear overtime and mileage reimbursement costs. For the first case, 40 data sets were solved, each consisting of either 15 or 20 therapists and between roughly 300 and 540 patient visits over five days. For each instance, we were able to obtain the minimum cost of providing residential healthcare services using a commercial solver. The results showed that CPU time increases more rapidly than total cost as the total number of visits grows. For the second case, which was much more difficult, it was necessary to develop heuristics to find good solutions quickly. Results for 5- through 20-therapist instances are presented and compared to the linear programming relaxation lower bounds. In the first of two parametric analyses, the tradeoff between the number of therapists on staff and the cost of providing service was examined. In the second, a similar tradeoff was explored between cost can the number of home bases used by the therapists.     

An agent-based nurse rostering system under minimal staffing conditions

Nurse rostering is a complex problem. We propose a new heuristic using a competitive agent-based negotiation that focuses on nurse preferences called competitive nurse rostering (CNR). Unlike the existing literature, CNR models each nurse's preference functions separately and separates the cost minimization and preference maximization problems. CNR produces quality nurse rosters even though it cannot leverage extra staffing. As an agent system, CNR can distribute computational requirements over several computer systems, include other solution methods at various points in of the rostering problem, and act as a real-time scheduling system. These benefits are not naturally inherent in centralized heuristic solutions.     

基于模糊积分的新产品开发合作伙伴选择

新产品开发合作伙伴选择需要考虑的因素很多,既有定性的也有定量的。对于定性指标运用三角模糊数将其量化,并引入核心企业的风险态度因子,通过映射将决策信息转化为点值决策信息;同时利用熵权的求法来确定模糊密度。在此基础上建立基于模糊积分的优选模型,从而选出最满意的合作伙伴,并通过实例进行有效分析。     

对中期财务报告准则的几点思考

本就中期财务报告准则的有关问题进行了阐述，重点讨论了中期财务报告准则的制定背景、理论依据及启示等问题。章认为，中期财务报告准则的制定符合我国的客观实际，有助于提高上市公司会计信息质量，保护投资的利益。     

粗糙表面电磁散射系数数字方法分析与比较

回顾了随机粗糙表面电磁散射特性计算方法的特点,分析对比了各类积分方程法和微分方程法的核心算法,着重讨论了矩阵分裂算法的计算效率,以及时域有限差分法求解色散粗糙面宽带散射特性的有关问题,指出了粗糙表面散射系数的计算和选择方法。     

订单生产经济批量问题研究

通过引入分批算法 ,解决了企业进行多品种生产过程中所面对的调度和优化问题。本算法由两步构成 :第一步采用遗传算法进行合理地分批 ;第二步通过规划模型求得分批基础上的最优调度。     

输电钢管杆稳定性分析的阶梯折算法

应用一维非均质体结构的阶梯折算法理论,建立了输电钢管杆的数值分析模型,推导了钢管杆的整体稳定计算方法,算法运用计算机易于实现,解决了荷载和刚度沿杆体变化的复杂杆结构整体稳定二阶计算问题,在电网工程建设和设计中有较好的实用价值。     

基于最小费用模型的航材调度研究

基于最小费用模型，建立了一定航材供给条件下，单架机缺件和多架机缺件的航材调度总费用函数；同时，考虑航材共享模式解决方案，建立了在航材共享条件下最小费用模型函数，并提出航材物流运输中广义效费比的概念，给出共享模式下广义效费比函数，并应用算例验证了最小费用模型函数和广义效费比函数的有效性和实用性。研究表明，航材共享模式可降低航材调度物流费用。     

浅谈智能四向穿梭车系统及调度策略

对托盘类智能四向穿梭车调度策略及周边技术进行了研究,介绍了软件系统的调度策略及应用场景,对智能四向穿梭车硬件避障功能进行描述,同时对仿真技术、传感技术和5G网络技术在物流行业内的发展和应用给予关注。     

未确知数减法运算的推广

本文是文献[1]定义的未确知数减法运算的推广,且给出了一个新的定义方式.