scholarly journals Modeling and statistical analysis of complexity in manufacturing systems under flow shop and hybrid environments

Author(s):  
Germán Herrera Vidal ◽  
Jairo R. Coronado Hernández ◽  
Claudia Minnaard
2021 ◽  
Author(s):  
Germán Herrera Vidal ◽  
Jairo Rafael Coronado Hernandez ◽  
Claudia Minnaard

Abstract In manufacturing systems, there are environments where the elaboration of a product requires a series of sequential operations, involving the configuration of machines by stages, intermediate buffer capacities, definition of assembly lines and routing of parts. The objective of this research is to develop a modeling and statistical analysis of complexity in manufacturing systems under flow shop and hybrid environments. The methodological approach starts with the structural modeling, then the measurement of the complexity in the systems is developed, the hypotheses are proposed and finally an experimental and factorial statistical analysis is developed. The results obtained corroborate the hypotheses proposed, where statistically the structural design factors and the variation of production time per stage have a significant influence on the response variable associated to the total complexity. Similarly, there is evidence of correlation between the performance indicators and the variable studied, in which the incidence with production costs stands out.


2019 ◽  
Vol 39 (5) ◽  
pp. 944-962 ◽  
Author(s):  
Sahar Tadayonirad ◽  
Hany Seidgar ◽  
Hamed Fazlollahtabar ◽  
Rasoul Shafaei

Purpose In real manufacturing systems, schedules are often disrupted with uncertainty factors such as random machine breakdown, random process time, random job arrivals or job cancellations. This paper aims to investigate robust scheduling for a two-stage assembly flow shop scheduling with random machine breakdowns and considers two objectives makespan and robustness simultaneously. Design/methodology/approach Owing to its structural and algorithmic complexity, the authors proposed imperialist competitive algorithm (ICA), genetic algorithm (GA) and hybridized with simulation techniques for handling these complexities. For better efficiency of the proposed algorithms, the authors used artificial neural network (ANN) to predict the parameters of the proposed algorithms in uncertain condition. Also Taguchi method is applied for analyzing the effect of the parameters of the problem on each other and quality of solutions. Findings Finally, experimental study and analysis of variance (ANOVA) is done to investigate the effect of different proposed measures on the performance of the obtained results. ANOVA's results indicate the job and weight of makespan factors have a significant impact on the robustness of the proposed meta-heuristics algorithms. Also, it is obvious that the most effective parameter on the robustness for GA and ICA is job. Originality/value Robustness is calculated by the expected value of the relative difference between the deterministic and actual makespan.


Author(s):  
J. T. Black ◽  
David S. Cochran

AND THE WORLD CAME TO SEE. When a new manufacturing system design (MSD) is developed by a company or a group of companies, the rest of the world comes to those factories to learn about the new system. In the last 200 years, three new factory designs have evolved, called the job shop, the flow shop and the lean shop. Each is based on a new system design — a functional design, a product flow design and a linked cell design. New factory designs lead to new industrial leaders and even new industrial revolutions (IR’s). Two appendixes are included: One outlines the implementation strategy for the lean shop and the other is a discussion of lean manufacturing from the viewpoint of K. Hitomi, Japanese professor of manufacturing systems engineering.


2012 ◽  
Vol 488-489 ◽  
pp. 1114-1118 ◽  
Author(s):  
Sagar U. Sapkal ◽  
Dipak Laha ◽  
Dhiren Kumar Behera

This paper deals with a general continuous or no-wait manufacturing scheduling problem. Due to its applications in advanced manufacturing systems, no-wait scheduling has gained much attention in both practical and academic fields. Due to its NP-hard nature, most of the contributions focus on development of approximation based optimization methods or heuristics for the problem. Several heuristic procedures have been developed to solve this problem. This paper presents a survey of various methodologies developed to solve no-wait flow shop scheduling problem with the objective of minimizing single performance measure


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Vladimir Modrak ◽  
Zuzana Soltysova

Manufacturing systems can be considered as a network of machines/workstations, where parts are produced in flow shop or job shop environment, respectively. Such network of machines/workstations can be depicted as a graph, with machines as nodes and material flow between the nodes as links. The aim of this paper is to use sequences of operations and machine network to measure static complexity of manufacturing processes. In this order existing approaches to measure the static complexity of manufacturing systems are analyzed and subsequently compared. For this purpose, analyzed competitive complexity indicators were tested on two different manufacturing layout examples. A subsequent analysis showed relevant potential of the proposed method.


2013 ◽  
Vol 345 ◽  
pp. 438-441
Author(s):  
Jing Chen ◽  
Xiao Xia Zhang ◽  
Yun Yong Ma

This paper presents a novel hybrid ant colony optimization approach (ACO&VNS) to solve the permutation flow-shop scheduling problem (PFS) in manufacturing systems and industrial process. The main feature of this hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with variable neighborhood search (VNS) which can also be embedded into the ACO algorithm as neighborhood search to improve solutions. Moreover, the hybrid algorithm considers both solution diversification and solution quality. Finally, the experimental results for benchmark PFS instances have shown that the hybrid algorithm is very efficient to solve the permutation flow-shop scheduling in manufacturing engineering compared with the best existing methods in terms of solution quality.


Author(s):  
Dong Han ◽  
Wangming Li ◽  
Xinyu Li ◽  
Liang Gao ◽  
Yang Li

Abstract As we all know, the COVID-19 pandemic brought a great challenge to manufacturing industry, especially for some traditional and unstable manufacturing systems. It reminds us that intelligent manufacturing certainly will play a key role in the future. Dynamic shop scheduling is also an inevitable hot topic in intelligent manufacturing. However, traditional dynamic scheduling is a kind of passive scheduling mode which takes measures to adjust disturbed scheduling processes after the occurrence of dynamic events. It is difficult to ensure the stability of production because of lack of proactivity. To overcome these shortcomings, manufacturing big data and data technologies as the core driving force of intelligent manufacturing will be used to guide production. Thus, a data-driven proactive scheduling approach is proposed to deal with the dynamic events, especially for machine breakdown. In this paper, the overall procedure of the proposed approach is introduced. More specifically, we first use collected manufacturing data to predict the occurrence of machine breakdowns and provide reliable input for dynamic scheduling. Then a proactive scheduling model is constructed for the hybrid flow shop problem, and an intelligent optimization algorithm is used to solve the problem to realize proactive scheduling. Finally, we design comparative experiments with two traditional rescheduling strategies to verify the effectiveness and stability of the proposed approach.


2011 ◽  
Vol 2011.60 (0) ◽  
pp. _507-1_-_507-2_
Author(s):  
Tatsuhiko SAKAGUCHI ◽  
Tatsurou MURAKAMI ◽  
Syohei FUJITA ◽  
Yoshiaki SHIMIZU ◽  
Keiichi SHIRASE

Sign in / Sign up

Export Citation Format

Share Document