A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This paper presents an implementation of simulated Kalman filter (SKF) algorithm for optimizing an assembly sequence planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to producedoi:10.15282/mekatronika.v1i2.4794 fatcat:lixznzb5rjdnbfw3e35jg3lodq