Lean production system design for fishing net manufacturing using lean principles and simulation optimization

Value stream mapping (VSM) is a useful tool for describing the manufacturing state, especially for distinguishing between those activities that add value and those that do not. It can help in eliminating non-value activities and reducing the work in process (WIP) and thereby increase the service level. This research follows the guidelines for designing future state VSM. These guidelines consist of five factors which can be changed simply, without any investment. These five factors are (1) production unit; (2) pacemaker process; (3) number of batches; (4) production sequence; and (5) supermarket size. The five factors are applied to a fishing net manufacturing system. Using experimental design and a simulation optimizing tool, the five factors are optimized. The results show that the future state maps can increase service level and reduce WIP by at least 29.41% and 33.92% respectively. For the present study, the lean principles are innovatively adopted in solving a fishing net manufacturing system which is not a well-addressed problem in literature. In light of the promising empirical results, the proposed methodologies are also readily applicable to similar industries.     

Model repair — aligning process models to reality

Process mining techniques relate observed behavior (i.e., event logs) to modeled behavior (e.g., a BPMN model or a Petri net). Process models can be discovered from event logs and conformance checking techniques can be used to detect and diagnose differences between observed and modeled behavior. Existing process mining techniques can only uncover these differences, but the actual repair of the model is left to the user and is not supported. In this paper we investigate the problem of repairing a process model w.r.t. a log such that the resulting model can replay the log (i.e., conforms to it) and is as similar as possible to the original model. To solve the problem, we use an existing conformance checker that aligns the runs of the given process model to the traces in the log. Based on this information, we decompose the log into several sublogs of non-fitting subtraces. For each sublog, either a loop is discovered that can replay the sublog or a subprocess is derived that is then added to the original model at the appropriate location. The approach is implemented in the process mining toolkit ProM and has been validated on logs and models from several Dutch municipalities.     

Systematic convergence of nonlinear stochastic estimators on the Special Orthogonal Group SO(3)

This paper introduces two novel nonlinear stochastic attitude estimators developed on the Special Orthogonal Group with the tracking error of the normalized Euclidean distance meeting predefined transient and steady‐state characteristics. The tracking error is confined to initially start within a predetermined large set such that the transient performance is guaranteed to obey dynamically reducing boundaries and decrease smoothly and asymptotically to the origin in probability from almost any initial condition. The proposed estimators produce accurate attitude estimates with remarkable convergence properties using measurements obtained from low‐cost inertial measurement units. The estimators proposed in continuous form are complemented by their discrete versions for the implementation purposes. The simulation results illustrate the effectiveness and robustness of the proposed estimators against uncertain measurements and large initialization error, whether in continuous or discrete form.     

随机库存分配问题的一种求解方法

讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

Parameter Uncertainty and Policy Intensity: Some Extensions and Suggestions for Further Work

The effects of parameter uncertainty on optimal policy have been a matter of interest for academics, and even for some policymakers, for a long time. Two lines of literature have developed analytical results on this matter. The first line uses static models and the second dynamic models. In this dynamic line most of the results are confined to models with a single state and a single control variable. In this paper we want to encourage the analysis of more general dynamic cases. To do so, the results in the dynamic line are extended from one-state and one-control finite horizon models to models with a pair of control variables. We then discuss some of the hurdles which must be surmounted for the results to be made more general and suggests some lines for further research. JEL classification: C61; E61     

An original approximate method for estimating the invariant probability distribution of a large class of multi-dimensional nonlinear stochastic oscillators

This paper proposes an original method for obtaining analytical approximations of the invariant probability density function of multi-dimensional Hamiltonian dissipative dynamic systems under Gaussian white noise excitations, with linear non-conservative parts and nonlinear conservative parts. The method is based on an exact result and a heuristic argument. Its pertinence is attested by numerical tests.     

A robust adaptive pole‐placement controller without strictly positive real condition

This paper considers the adaptive pole‐placement control problem for system (1) with unmodelled dynamics η_n dominated by a small constant ε multiplied by a quantity independent of ε but tending to infinity as the past input, output, and noise grow. Using bounded external excitation and randomly varying truncation techniques, we give a design method of adaptive pole‐placement controller. It is shown that the closed‐loop system is globally stable, the estimation error for the parameter contained in the modelled part is of order ε, and the closed‐loop system under the adaptive pole‐placement control law is suboptimal in the sense of $$\mathop{\lim\sup}\limits_{{n\to\infty }}{1\over n}\mathop{\sum}\limits_{i=0}^n{\left({A^{*}(z)y_{n}‐L(z)C(z)w_{n}‐B(z)R(z)y_{n}^{*}}\right)^{2}{\leq}O({\varepsilon}^{2})+\gamma^{2}\mathop{\sum}\limits_{j=1}^q{b_{j}^{2}}}$$\nopagenumbers\end while the SPR condition used usually in other papers is replaced by a stability condition. Copyright © 2001 John Wiley & Sons, Ltd.     

Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Issues in nonlinear stochastic grey box identification

Grey box identification refers to the practice of identifying dynamical systems in model structures exploiting partial prior information. This contribution reviews a method for stochastic grey box identification and surveys experiences and lessons of applying it to a number of industrial processes. Issues to be addressed include advantages and costs of introducing stochastics into the model, the question of what contribution must be expected from the model designer as opposed to what can be formalized in computer algorithms, and an outlook on future plans to resolve present shortcomings.