Search

Disassembly is indispensable to recycle and remanufacture end-of-life products, and a disassembly line-balancing problem (DLBP) is studied frequently. Recent research on disassembly lines has focused on a complete disassembly for optimising the balancing ability of lines. However, a partial disassembly process is widely applied in the current industry practice, which aims at reusing valuable components and maximising the profit (or minimising the cost). In this paper, we consider a profit-oriented partial disassembly line-balancing problem (PPDLBP), and a mathematical model of this problem is established, which is to achieve the maximisation of profit for dismantling a product in DLBP. The PPDLBP is NP-complete since DLBP is proven to be a NP-complete problem, which is usually handled by a metaheuristics. Therefore, a novel efficient approach based on gravitational search algorithm (GSA) is proposed to solve the PPDLBP. GSA is an optimisation technique that is inspired by the Newtonian gravity and the laws of motion. Also, two different scale cases are used to test on the proposed algorithm, and some comparisons with the CPLEX method, particle swarm optimisation, differential evolution and artificial bee colony algorithms are presented to demonstrate the excellence of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper develops two analytical formulas for estimating the throughput of a reliable production line with exponential service times and finite intermediate buffers. The formulas apply in the case of an approximately balanced line with identical buffers or near optimal buffer allocations, where the processing times of the machines are close to each other but not necessarily the same. The derivation of the formulas is based on the standard decomposition method. Moreover, it is proved that, in general cases, both formulas provide upper bounds for the throughput obtained by the decomposition method. Numerical experiments show that the proposed formulas achieve good accuracy for approximately balanced production lines. Finally, the formulas are applied to the buffer allocation problem, and two closed-form expressions are obtained for estimating the smallest buffer capacity which is necessary to achieve the desired throughput. [ABSTRACT FROM AUTHOR]

This paper proposes a new type of assembly line worker assignment and balancing problem (ALWABP) which considers ergonomic risks. ALWABP occurs when task times vary according to the assigned worker. Although the operation time of a task is assumed to be fixed in classical assembly lines, it depends on the operator who executes the task in ALWABP. In ALWABP literature, the primary and secondary objectives are minimizing cycle time and balancing workload among workstations smoothly, respectively. When smoothing workload, only task times are taken into consideration in the relevant literature. However, degree of difficulty of tasks is also very important. Two workers executing two different stations with the same station time are assumed to be equally loaded according to the traditional perception. In fact, even they have the same station time; their workloads are different because of the different tasks they execute, in real life assembly line configurations. In order to close this gap between the real life and the literature, this study introduces an ALWABP problem with considering ergonomic risk factors (ErgoALWABP). Due to the complex nature of the problem, optimum seeking methods are not capable of solving it. So, the proposed problem is tackled with the multiple-rule based constructive randomized search approach. Also, OCcupational Repetitive Action method is used for making ergonomic risk assessment. Performance of the proposed solution procedure is compared with the relevant literature on benchmark data. Experimental results show that ergonomic environment could be improved when ergonomic risk factors are taken into account. [ABSTRACT FROM AUTHOR]

Modern manufacturing systems are expected to be flexible and efficient in order to cope with challenging market demands. Thus, they must be flexible enough as to meet changing requirements such as changes in production, energy efficiency, performance optimization, fault tolerance to process or controller faults, among others. Demanding requirements can be defined as a set of quality of service (QoS) requirements to be met. This paper proposes a generic and customizable multi-agent architecture that, making use of distributed agents, monitors QoS, triggering, if needed, a reconfiguration of the control system to recover QoS. As a proof of concept, the architecture has been implemented to provide availability of the control system understood as service continuity. The prototype has been tested in a case study consisting of an assembly cell where assessment of the approach has been conducted. [ABSTRACT FROM AUTHOR]

We study the problem of sequencing mixed-model assembly lines operating with a heterogeneous workforce. The practical motivation for this study comes from the context of managing assembly lines in sheltered work centres for the disabled. We propose a general framework in which task execution times are both worker and model dependent. Within this framework, the problem is defined and mathematical mixed-integer models and heuristic procedures are proposed. These include a set of fast constructive heuristics, two local search procedures based on approximate measures using either a solution upper bound or the solution of a linear program and a GRASP metaheuristic. Computational tests with instances adapted from commonly used literature databases are used to validate the proposed approaches. These tests give insight on the quality of the different techniques, which prove to be very efficient both in terms of computational effort and solution quality when compared to other strategies such as a random sampling or the solution of the MIP models using a commercial solver. [ABSTRACT FROM PUBLISHER]

This paper is aimed at reducing the costs, maintaining the quality and designing the plant layout that is flexible to meet the customer demand. A number of stations in the after test assembly and after paint assembly are selected for capturing the production process requirements. Then, failure mode and effects analysis of after test assembly is carried out. Layout designs for the after test assembly and after paint assembly are developed using systematic layout planning and are validated using Spaghetti diagrams. With the improved layout, considerable reduction in the distance moved by the operator has resulted in 20% cost saving at 80% Takt time. [ABSTRACT FROM AUTHOR]

Assembly lines with non-constant task time attribute are widely studied in the literature. For the SALBP-II assembly line balancing problem, we take account of stochastic task time changes, which is more practical than the deterministic times often assumed in industrial application. An algorithm - ENCORE, which leverages the traditional algorithm SALOME2, is proposed to address the assembly line balancing problem with stochastic task time attribute. Computational and statistical experiments are conducted to show the efficiency of proposed algorithms over traditional methods with regards to the improvement of total production times. [ABSTRACT FROM AUTHOR]

The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers’ skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising the cycle time. In this study, a two-phase variable neighbourhood search (VNS) algorithm is proposed to solve the ALWABP-2 due to the NP-hard nature of this problem. In the first phase of the algorithm, a VNS approach is applied to assign tasks to workstations with the aim of minimising the cycle time while in the second phase, a variable neighbourhood descent method is applied to assign workers to workstations. The performance of the proposed algorithm is tested on well-known benchmark instances. In addition, the proposed algorithm has been used to solve a real case study from a consumer electronics company that manufactures LCD TVs. The results show that the algorithm is superior to the methods reported in the literature in terms of its higher efficiency and robustness. Furthermore, the algorithm is easy to implement and significantly improves the performance of the final assembly line for the investigated LCD TV real case study. [ABSTRACT FROM AUTHOR]

Assembly lines of big-size products such as buses, trucks and helicopters are very different from the lines studied in the literature. These products’ manufacturing processes have a lot of tasks most of which have long task times. Since traditional assembly line models including only one worker in each station (i.e. simple assembly lines) or at most two workers (two-sided assembly lines) may not be suitable for manufacturing these type of products, they need much larger shop floor for a number of stations and long product flow times. In this study, an assembly line balancing problem (ALBP) with parallel multi-manned stations is considered. Following the problem definition, a mixed integer programming formulation is developed. A detailed study of priority rules for simple ALBPs is also presented, and a new efficient constructive heuristic algorithm based on priority rules is proposed. In order to improve solutions found by the constructive heuristic, a genetic algorithm-based solution procedure is also presented. Benchmark instances in the literature are solved by using the proposed mathematical programming formulation. It has been seen that only some of the small-size instances can be solved optimally by this way. So the efficiency of the proposed heuristic method is verified in small-size instances whose optimal solutions are found. For medium- and big-size instances, heuristics’ results and CPU times are demonstrated. A comparative evaluation with a branch and bound algorithm that can be found in the literature is also carried out, and results are presented. [ABSTRACT FROM PUBLISHER]

In real world, line balancing involves existing lines in existing factories and the line typically needs to be rebalanced rather than balanced. Rebalancing of a U-line can be defined as a changeover process from its initial configuration to a new configuration for a while due to the reasons such as demand variations, changes in product design and changes in task times, etc. This study defines U-line rebalancing problem with stochastic task times and proposes a solution procedure based on ant colony optimisation. The objective of the proposed algorithm is to minimise total cost of rebalancing which is the sum of task transposition costs, workstation opening/closing costs and operating costs of workstations for a particular planning horizon. A comprehensive experiment is conducted to generate problem instances and to compare rebalancing costs of U-lines by means of several factors. A total of 6600 rebalancing solutions are obtained and several comparisons are performed. [ABSTRACT FROM PUBLISHER]

The majority of the current product configurators defined for the small or medium-sized enterprise one-of-a-kind production (SME OKP) with the dominant variation of the product by typology are derived from the assemble-to-order (ATO) production configurators. Unfortunately, they do not provide the customers with the possibility to adjust the products to their specific needs and further configuration-related actions through specialized software interfaces are required. On the basis of a detailed 1-year-long customer behavior tracking and analysis, the following key issues of the actual configurators have been defined: a low degree of the product adjustment, the complexity of the process of modeling the adjusted product, the extension of the leading time, a separated process of modeling, and the establishment of the communication channel between the customer and the manufacturer in the real time. The proposed solution is based on integrating the existing configurators into one common software application. It should act mainly as the necessary real-time communication channel between the customer and manufacturer in order to alleviate the effects of the product complex paradox. With this concept, the reduction of the leading time is observed as the additional positive effect. The case study illustrates the basic principles and technology required for the practical realization of the proposed solution for the configuration processes of the products in the SME OKP for the PVC windows manufacturing in the hybrid manufacturing cloud environment. [ABSTRACT FROM AUTHOR]