The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Process Optimization and NVA Reduction by Network Analysis and Resequencing
Abstract
The article discusses a methodology to reduce cycle times through an algorithmic, analytical framework for sequential process flows. Studying process flow flexibility for reducing bottlenecks has always continued to open new research avenues. This methodology has been formulated keeping in view of sequential manually executed assembly processes, where a single operator is involved, the process steps are entirely manual or semi-automated. The concept can also be extended to other scenarios by computing a process flexibility measure in terms of time, resources and methods. Essentially this article talks about the use of an algorithm for effective scheduling on assembly lines, computing the most optimal path that that the process flow could have taken given how the process has proceeded. Current activity scheduling methods tally the progress against a plan, which is ideal and does not account for unforeseen wait times. The output of the algorithm which is the most optimal approach as computed for a given scenario will help achieve rhythm and reduce wasted time in places where it's possible to avoid them. A standard tool to measure the exact amount of compressible wait time or Muda Type of waste is chosen, the overall equipment efficiency was adopted for gauging this approach. This discusses the generalization of the principle used and its formulation as an algorithm and a flow chart.
Related Content
|
Vejn Sredic.
© 2023.
17 pages.
|
|
Murtadha Albuali.
© 2021.
6 pages.
|
|
Jae-Dong Hong.
© 2021.
20 pages.
|
|
Brian J. Galli.
© 2021.
16 pages.
|
|
Ali Keshavarz Panahi, Sohyung Cho, Chris Gordon.
© 2021.
16 pages.
|
|
Norman Gwangwava.
© 2021.
14 pages.
|
|
Brian J. Galli.
© 2020.
27 pages.
|
|
|