Search results
1 – 10 of over 125000Faruk Serin, Süleyman Mete and Erkan Çelik
Changing the product characteristics and demand quantity resulting from the variability of the modern market leads to re-assigned tasks and changing the cycle time on the…
Abstract
Purpose
Changing the product characteristics and demand quantity resulting from the variability of the modern market leads to re-assigned tasks and changing the cycle time on the production line. Therefore, companies need re-balancing of their assembly line instead of balancing. The purpose of this paper is to propose an efficient algorithm approach for U-type assembly line re-balancing problem using stochastic task times.
Design/methodology/approach
In this paper, a genetic algorithm is proposed to solve approach for U-type assembly line re-balancing problem using stochastic task times.
Findings
The performance of the genetic algorithm is tested on a wide variety of data sets from literature. The task times are assumed normal distribution. The objective is to minimize total re-balancing cost, which consists of workstation cost, operating cost and task transposition cost. The test results show that proposed genetic algorithm approach for U-type assembly line re-balancing problem performs well in terms of minimizing total re-balancing cost.
Practical implications
Demand variation is considered for stochastic U-type re balancing problem. Demand change also affects cycle time of the line. Hence, the stochastic U-type re-balancing problem under four different cycle times are analyzed to present practical case.
Originality/value
As per the authors’ knowledge, it is the first time that genetic algorithm is applied to stochastic U-type re balancing problem. The large size data set is generated to analyze performance of genetic algorithm. The results of proposed algorithm are compared with ant colony optimization algorithm.
Details
Keywords
Prem Singh and Himanshu Chaudhary
This paper aims to present the optimum two-plane discrete balancing procedure for rigid rotor. The discrete two-plane balancing in which rotor is balanced to minimize the residual…
Abstract
Purpose
This paper aims to present the optimum two-plane discrete balancing procedure for rigid rotor. The discrete two-plane balancing in which rotor is balanced to minimize the residual effects or the reactions on the bearing supports using discrete parameters such as masses and their angular positions on two balancing planes.
Design/methodology/approach
Therefore as a multi-objective optimization problem is formulated by considering reaction forces on the bearing supports as a multi objective functions and discrete parameters on each balancing plane as design variables. These multi-objective functions are converted into a single-objective function using appropriate weighting factors. Further, this optimization problem is solved using discrete optimization algorithm, based on Jaya algorithm.
Findings
The performance of the discrete Jaya algorithm is compared to genetic algorithm (GA) algorithm. It is found that Jaya algorithm is computationally more efficient than GA algorithm. A number of masses per plane are used to balance the rotor. A comparison of reaction forces using number of masses per plane is investigated.
Originality/value
The effectiveness of the proposed methodology is tested by the balancing problem of rotor available in the literature. The influence of a number of balance masses on bearing forces and objective function are discussed. ADAMS software is used for validation of a developed balancing approach.
Details
Keywords
Beikun Zhang and Liyun Xu
The increasing energy shortage leads to worldwide attentions. This paper aims to develop a mathematical model and optimization algorithm to solve the energy-oriented U-shaped…
Abstract
Purpose
The increasing energy shortage leads to worldwide attentions. This paper aims to develop a mathematical model and optimization algorithm to solve the energy-oriented U-shaped assembly line balancing problem. Different from most existing works, the energy consumption is set as a major objective.
Design/methodology/approach
An improved flower pollination algorithm (IFPA) is designed to solve the problem. The random key encoding mechanism is used to map the continuous algorithm into discrete problem. The pollination rules are modified to enhance the information exchange between individuals. Variable neighborhood search (VNS) is used to improve the algorithm performance.
Findings
The experimental results show that the two objectives are in conflict with each other. The proposed methodology can help manager obtain the counterbalance between them, for the larger size balancing problems, and the reduction in objectives is even more significant. Besides, the experiment results also show the high efficiency of the proposed IFPA and VNS.
Originality/value
The main contributions of this work are twofold. First, a mathematical model for the U-shaped assembly line balancing problem is developed and the model is dual foci including minimized SI and energy consumption. Second, an IFPA is proposed to solve the problem.
Details
Keywords
Cycle time fluctuations in assembly lines are one of the important reasons of re‐balancing. As a result of re‐balancing of assembly lines, it will be necessary to change task…
Abstract
Purpose
Cycle time fluctuations in assembly lines are one of the important reasons of re‐balancing. As a result of re‐balancing of assembly lines, it will be necessary to change task sequences or equipment locations. The purpose of this paper is to find the task sequence which enables assembly line balancing (ALB) with minimum number of stations (NS) for different cycle times such that tasks and equipment or fixture locations remain unchanged.
Design/methodology/approach
In this paper a heuristic which consist of two stages is proposed to find a common task sequence for different cycle times in assembly lines.
Findings
It is shown that optimal NS for different cycle times can be achieved with a fixed task sequence.
Research limitations/implications
The approach is limited to a single model case. Model variety together with cycle time variety can be investigated in further studies.
Practical implications
Assembly lines which require less time and cost for re‐balancing can be easily designed by the proposed approach.
Originality/value
ALB problem is handled with a new viewpoint. Also, it is observed that the proposed approach serves as a bridge between assembly line design and balancing. In this regard, it is thought to have an important place in the ALB literature.
Details
Keywords
This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics…
Abstract
This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics include: theory – domain decomposition/partitioning, load balancing, parallel solvers/algorithms, parallel mesh generation, adaptive methods, and visualization/graphics; applications – structural mechanics problems, dynamic problems, material/geometrical non‐linear problems, contact problems, fracture mechanics, field problems, coupled problems, sensitivity and optimization, and other problems; hardware and software environments – hardware environments, programming techniques, and software development and presentations. The bibliography at the end of this paper contains 850 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1996 and 2002.
Details
Keywords
Humyun Fuad Rahman, Mukund Nilakantan Janardhanan and Peter Nielsen
Optimizing material handling within the factory is one of the key problems of modern assembly line systems. The purpose of this paper is to focus on simultaneously balancing a…
Abstract
Purpose
Optimizing material handling within the factory is one of the key problems of modern assembly line systems. The purpose of this paper is to focus on simultaneously balancing a robotic assembly line and the scheduling of material handling required for the operation of such a system, a topic that has received limited attention in academia. Manufacturing industries focus on full autonomy because of the rapid advancements in different elements of Industry 4.0 such as the internet of things, big data and cloud computing. In smart assembly systems, this autonomy aims at the integration of automated material handling equipment such as automated guided vehicles (AGVs) to robotic assembly line systems to ensure a reliable and flexible production system.
Design/methodology/approach
This paper tackles the problem of designing a balanced robotic assembly line and the scheduling of AGVs to feed materials to these lines such that the cycle time and total tardiness of the assembly system are minimized. Because of the combination of two well-known complex problems such as line balancing and material handling and a heuristic- and metaheuristic-based integrated decision approach is proposed.
Findings
A detailed computational study demonstrates how an integrated decision approach can serve as an efficient managerial tool in designing/redesigning assembly line systems and support automated transportation infrastructure.
Originality/value
This study is beneficial for production managers in understanding the main decisional steps involved in the designing/redesigning of smart assembly systems and providing guidelines in decision-making. Moreover, this study explores the material distribution scheduling problems in assembly systems, which is not yet comprehensively explored in the literature.
Details
Keywords
Michel Toulouse, H.K. Dai and Truong Giang Le
Sharding of blockchains consists of partitioning a blockchain network into several sub-networks called “shards,” each shard processing and storing disjoint sets of transactions in…
Abstract
Purpose
Sharding of blockchains consists of partitioning a blockchain network into several sub-networks called “shards,” each shard processing and storing disjoint sets of transactions in parallel. Sharding has recently been applied to public blockchains to improve scalability through parallelism. The throughput of sharded blockchain is optimized when the workload among the shards is approximately the same. The purpose of this paper is to investigate the problem of balancing workload of account-based blockchains such as Ethereum.
Design/methodology/approach
Two known consensus-based distributed load-balancing algorithms have been adapted to sharded blockchains. These algorithms migrate accounts across shards to balance transaction processing times. Two methods to predict transaction processing times are proposed.
Findings
The authors identify some challenging aspects for solving the load-balancing problem in sharded blockchains. Experiments conducted with Ethereum transactions show that the two load-balancing algorithms are challenged by accounts often created to process a single transaction to optimize anonymity, while existing accounts sparsely generate transactions.
Originality/value
Tests in this work have been conducted on transactions originating from a blockchain platform rather than using artificially generated data distributions. They show the specificity of the load-balancing problem for sharded blockchains, which were hidden in artificial data sets.
Details
Keywords
Binghai Zhou and Qiong Wu
The extensive applications of the industrial robots have made the optimization of assembly lines more complicated. The purpose of this paper is to develop a balancing method of…
Abstract
Purpose
The extensive applications of the industrial robots have made the optimization of assembly lines more complicated. The purpose of this paper is to develop a balancing method of both workstation time and station area to improve the efficiency and productivity of the robotic assembly lines. A tradeoff was made between two conflicting objective functions, minimizing the number of workstations and minimizing the area of each workstation.
Design/methodology/approach
This research proposes an optimal method for balancing robotic assembly lines with space consideration and reducing robot changeover and area for tools and fixtures to further minimize assembly line area and cycle time. Due to the NP-hard nature of the considered problem, an improved multi-objective immune clonal selection algorithm is proposed to solve this constrained multi-objective optimization problem, and a special coding scheme is designed for the problem. To enhance the performance of the algorithm, several strategies including elite strategy and global search are introduced.
Findings
A set of instances of different problem scales are optimized and the results are compared with two other high-performing multi-objective algorithms to evaluate the efficiency and superiority of the proposed algorithm. It is found that the proposed method can efficiently solve the real-world size case of time and space robotic assembly line balancing problems.
Originality/value
For the first time in the robotic assembly line balancing problems, an assignment-based tool area and a sequence-based changeover time are took into consideration. Furthermore, a mathematical model with bi-objective functions of minimizing the number of workstations and area of each station was developed. To solve the proposed problem, an improved multi-objective immune clonal selection algorithm was proposed and a special coding scheme is designed.
Details
Keywords
Mohammad Kamal Uddin, Marian Cavia Soto and Jose L. Martinez Lastra
Design, balancing, and sequencing are the key issues associated with assembly lines (ALs). The purpose of this paper is to identify AL design issues and to develop an integrated…
Abstract
Purpose
Design, balancing, and sequencing are the key issues associated with assembly lines (ALs). The purpose of this paper is to identify AL design issues and to develop an integrated methodology for mixed‐model assembly line balancing (MMALB) and sequencing. Primarily, mixed‐model lines are utilized for high‐variety, low‐volume job shop or batch production. Variation of a generic product is important for the manufacturers as the demand is mostly customer driven in the present global market.
Design/methodology/approach
Different AL design norms, performance indexes, and AL workstation indexes have been identified in the initial stage of this work. As the paper progresses, it has focused towards an integrated approach for MMALB and sequencing addressed for small‐ and medium‐scale assembly plants. A small‐scale practical problem has been justified with this integrated methodology implemented by MATLAB.
Findings
ALs execution in the production floor require many important factors to be considered. Different line orientations, production approaches, line characteristics, performance and workstation indexes, problem definitions, balancing and product sequencing in accordance with the objective functions are needed to be taken into account by the line designer.
Originality/value
This paper has highlighted the important AL design characteristics and also provided an integrated approach for balancing mixed‐model assembly lines (MMALs) combined with sequencing heuristic. The findings of this paper can be helpful for the designers while designing an AL. The integrated approach for balancing and sequencing of MMALs can be used as a functional tool for assembly‐based contemporary industries.
Details
Keywords
Mario Tabucanon and Wang Changli
Outlines the specific characteristics of semiautomatic productionlines which, in relative terms, are given less attention than othertypes of line. Suggests a methodology for…
Abstract
Outlines the specific characteristics of semiautomatic production lines which, in relative terms, are given less attention than other types of line. Suggests a methodology for balancing such lines, making comparison thereof with the traditional method of line balancing. Applies the method to a case which is a typical semiautomatic line.
Details