基于物联网的医用耗材智能屋管理系统

针对医用高值耗材种类繁多、管理难度大的问题,为减少人力成本、提高医用高值耗材的智能化管理水平。本文提出了基于物联网的高值医用耗材智能屋的管理系统,介绍了智能屋的整体架构、系统功能、核心业务及流程设计,主要分为结构模块、RFID模块、数据库模块、控制系统模块四大模块,具体有用户管理、出入库管理、综合查询、预警管理四大业务,通过GM(1,1)模型对2022年全年高值医用耗材的月消耗量进行预测分析,并且检验得该预测模型的精度等级为一级,模型预测效果很好,能够为医院采购人员采购提供了一个参考,避免因过度的主观估计而造成的耗材浪费。该系统能够有效地提高医院对于高值医用耗材的管理水平,减少人力、物力和财力的消耗,为广大患者提供更加优质的医疗服务。本文所提的高值医用耗材智能屋管理系统解决了传统的高值医用耗材管理的诸多难题。     

Safety Stock Determination with Serially Correlated Demand in a Periodic-Review Inventory System

We consider a periodic-review inventory replenishment model with an order-up-to-R operating doctrine for the case of deterministic lead times and a covariance-stationary stochastic demand process. A method is derived for setting the inventory safety stock to achieve an exact desired stockout probability when the autocovariance function for Gaussian demand is known. Because the method does not require that parametric time-series models be fit to the data, it is easily implemented in practice. Moreover, the method is shown to be asymptotically valid when the autocovariance function of demand is estimated from historical data. The effects on the stockout rate of various levels of autocorrelated demand are demonstrated for situations in which autocorrelation in demand goes undetected or is ignored by the inventory manager. Similarly, the changes to the required level of safety stock are demonstrated for varying levels of autocorrelation.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

An Algorithm for the Economic Design of <Emphasis Type="Italic">np</Emphasis> Charts for a Multiplicity of Assignable Causes

Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Availability Analysis of Repairable <Emphasis Type="Italic">N</Emphasis>-Server <Emphasis Type="Italic">n</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>-Replicated Systems

We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n _i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system.     

Best interpolation in seminorm with convex constraints

Implicit and explicit characterizations of the solutions to the following constrained best interpolation problem $$\min \left\{ {\left\| {Tx - z} \right\|:x \in C \cap A^{ - 1} d} \right\}$$ are presented. Here,T is a densely-defined, closed, linear mapping from a Hilbert spaceX to a Hilbert spaceY, A: X→Z is a continuous, linear mapping withZ a locally, convex linear topological space,C is a closed, convex set in the domain domT ofT, andd∈AC. For the case in whichC is a closed, convex cone, it is shown that the constrained best interpolation problem can generally be solved by finding the saddle points of a saddle function on the whole space, and, if the explicit characterization is applicable, then solving this problem is equivalent to solving an unconstrained minimization problem for a convex function.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.