The Effect of Learning on Assembly Line Balancing: A Review

Classical assembly line balancing (ALB) models assume constant cycle times during production. However, this assumption oversimplifies the actual situation, especially in small batch production of up to a few hundred units, since employees can significantly improve their performance thanks to the learning effect, causing task times to decrease. Several researchers have realised the importance of the effect of learning in ALB. However, only a limited number of papers have so far addressed this issue. This is problematic, since ignoring the learning effect in ALB may lead to inaccurate results and by extension misleading conclusions. This study summarises the main contributions in the field of ALB that focus on the learning effect. First, assembly lines (ALs) and ALB problems are characterised. Next, the importance of the learning effect in ALB is highlighted, and the main learning curve (LC) models are introduced. Finally, an exhaustive review of the main contributions in the field of ALB and learning effect is provided. The results highlight that many problems in this area need to be investigated further, in relation to both conceptual model building and the development of algorithms for solving practical size problems

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Research Trends and Outlooks in Assembly Line Balancing Problems

This paper presents the findings from the survey of articles published on the assembly line balancing problems (ALBPs) during 2014-2018. Before proceeding a comprehensive literature review, the ineffectiveness of the previous ALBP classification structures is discussed and a new classification scheme based on the layout configurations of assembly lines is subsequently proposed. The research trend in each layout of assembly lines is highlighted through the graphical presentations. The challenges in the ALBPs are also pinpointed as a technical guideline for future research works

Assembly Line

An assembly line is a manufacturing process in which parts are added to a product in a sequential manner using optimally planned logistics to create a finished product in the fastest possible way. It is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The present edited book is a collection of 12 chapters written by experts and well-known professionals of the field. The volume is organized in three parts according to the last research works in assembly line subject. The first part of the book is devoted to the assembly line balancing problem. It includes chapters dealing with different problems of ALBP. In the second part of the book some optimization problems in assembly line structure are considered. In many situations there are several contradictory goals that have to be satisfied simultaneously. The third part of the book deals with testing problems in assembly line. This section gives an overview on new trends, techniques and methodologies for testing the quality of a product at the end of the assembling line

Scheduling With Alternatives Machine Using Fuzzy Inference System And Genetic Algorithm.

As the manufacturing activities in today's industries are getting more and more complex, it is required for the manufacturing company to have a good shop floor production scheduling to plan and schedule their production orders. Industri pengeluarcim kini telah berkembang pesat dan aktiviti pengeluarannya semakin kompleks, dengan itu syarikat pengeluar memerlukan jadual lantai pengeluaran (shop floor) yang terbaik untuk merancang permintaan pengeluaran (product)

Algorithms and Methods for Designing and Scheduling Smart Manufacturing Systems

This book, as a Special Issue, is a collection of some of the latest advancements in designing and scheduling smart manufacturing systems. The smart manufacturing concept is undoubtedly considered a paradigm shift in manufacturing technology. This conception is part of the Industry 4.0 strategy, or equivalent national policies, and brings new challenges and opportunities for the companies that are facing tough global competition. Industry 4.0 should not only be perceived as one of many possible strategies for manufacturing companies, but also as an important practice within organizations. The main focus of Industry 4.0 implementation is to combine production, information technology, and the internet. The presented Special Issue consists of ten research papers presenting the latest works in the field. The papers include various topics, which can be divided into three categories—(i) designing and scheduling manufacturing systems (seven articles), (ii) machining process optimization (two articles), (iii) digital insurance platforms (one article). Most of the mentioned research problems are solved in these articles by using genetic algorithms, the harmony search algorithm, the hybrid bat algorithm, the combined whale optimization algorithm, and other optimization and decision-making methods. The above-mentioned groups of articles are briefly described in this order in this book

Discrete Optimization Methods for Segmentation and Matching

This dissertation studies discrete optimization methods for several computer vision problems. In the first part, a new objective function for superpixel segmentation is proposed. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. I present a new graph construction for images and show that this construction induces a matroid. The segmentation is then given by the graph topology which maximizes the objective function under the matroid constraint. By exploiting submodular and monotonic properties of the objective function, I develop an efficient algorithm with a worst-case performance bound of $\frac{1}{2}$ for the superpixel segmentation problem. Extensive experiments on the Berkeley segmentation benchmark show the proposed algorithm outperforms the state of the art in all the standard evaluation metrics. Next, I propose a video segmentation algorithm by maximizing a submodular objective function subject to a matroid constraint. This function is similar to the standard energy function in computer vision with unary terms, pairwise terms from the Potts model, and a novel higher-order term based on appearance histograms. I show that the standard Potts model prior, which becomes non-submodular for multi-label problems, still induces a submodular function in a maximization framework. A new higher-order prior further enforces consistency in the appearance histograms both spatially and temporally across the video. The matroid constraint leads to a simple algorithm with a performance bound of $\frac{1}{2}$. A branch and bound procedure is also presented to improve the solution computed by the algorithm. The last part of the dissertation studies the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been proposed for the problem, chamfer matching remains to be the preferred method when speed and robustness are considered. In this dissertation, I significantly improve the accuracy of chamfer matching while reducing the computational time from linear to sublinear (shown empirically). It is achieved by incorporating edge orientation information in the matching algorithm so the resulting cost function is piecewise smooth and the cost variation is tightly bounded. Moreover, I present a sublinear time algorithm for exact computation of the directional chamfer matching score using techniques from 3D distance transforms and directional integral images. In addition, the smooth cost function allows one to bound the cost distribution of large neighborhoods and skip the bad hypotheses. Experiments show that the proposed approach improves the speed of the original chamfer matching up to an order of 45 times, and it is much faster than many state of art techniques while the accuracy is comparable. I further demonstrate the application of the proposed algorithm in providing seamless operation for a robotic bin picking system

Modeling and Optimization of Disassembly Systems with a High Variety of End of Life States.

Remanufacturing is a promising product recovery method that brings new life to cores that otherwise would be discarded thus losing all value. Disassembly is a sub-process of remanufacturing where components and modules are removed from the core, sorted and graded, and directly reused, refurbished, recycled, or disposed of. Disassembly is the backbone of the remanufacturing process because this is where the reuse value of components and modules is realized. Disassembly is a process that is also very difficult in most instances because it is a mostly manual process creating stochastic removal times of components. There is a high variety of EOL states a core can be in when disassembled and an economic downside due to not all components having reuse potential. This thesis focuses on addressing these difficulties of disassembly in the areas of sequence generation, line balancing, and throughput modeling. In Chapter 2, we develop a series of sequence generation models that considers the material properties, partial disassembly, and sequence dependent task times to determine the optimal order of disassembly in the presence of a high variety of EOL states. In Chapter 3, we develop a joint precedence graph method for disassembly that models all possible EOL states a core can be in that can be used with a wide variety of line balancing algorithms. We also develop a stochastic joint precedence graph method in the situation where some removal times of components are normal random variables. In Chapter 4, we further advance the analytical modeling framework to analyze transfer lines that perform routing logics that result from a high variety of EOL states, such as a restrictive split routing logic and the possibility that disassembly and split operations can be performed at the same workstation.PhDIndustrial and Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/111570/1/robriggs_1.pd