11,917 research outputs found

    Simple heuristics for the assembly line worker assignment and balancing problem

    Full text link
    We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.Comment: 18 pages, 1 figur

    ์ž„์‹œ ์ž‘์—…์ž๋ฅผ ํ™œ์šฉํ•œ ํ˜ผํ•ฉ๋ชจ๋ธ ์กฐ๋ฆฝ๋ผ์ธ์˜ ํ†ตํ•ฉ์  ๊ท ํ˜•ํ™” ์—ฐ๊ตฌ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ์‚ฐ์—…๊ณตํ•™๊ณผ, 2015. 2. ๋ฌธ์ผ๊ฒฝ.์ด ๋…ผ๋ฌธ์€ ๋‹จ์ผ ์ œํ’ˆ์„ ์กฐ๋ฆฝํ•˜๋Š” ์ผ๋ฐ˜์ ์ธ ์กฐ๋ฆฝ๋ผ์ธ ๊ท ํ˜•ํ™” ๋ฌธ์ œ๋ฅผ ๋ณต์ˆ˜ ์ œํ’ˆ๋“ค์„ ๋™์‹œ์— ์กฐ๋ฆฝํ•  ์ˆ˜ ์žˆ๋Š” ํ˜ผํ•ฉ ๋ชจ๋ธ ์กฐ๋ฆฝ๋ผ์ธ์œผ๋กœ ํ™•์žฅํ•˜์˜€์œผ๋ฉฐ, ์ž„์‹œ ์ž‘์—…์ž๋ฅผ ๊ณ ์šฉํ•˜์—ฌ ์กฐ๋ฆฝ๋ผ์ธ์„ ํšจ์œจํ™”ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•˜์˜€๋‹ค. ์ด๋ฅผ ๊ณ ๋ คํ•œ ์„ธ ๊ฐ€์ง€ ๋ฒ„์ „์˜ ์ˆ˜ํ•™์  ๋ชจํ˜•๋“ค์„ ๊ฐœ๋ฐœํ•˜์˜€๋‹ค. ๊ฐ ๋ชจํ˜•์˜ ๋ชฉํ‘œ๋Š” ๋ชจ๋“  ์ง์›์˜ ์ž„๊ธˆ๊ณผ ์ž‘์—…์žฅ ๋น„์šฉ์„ ํ•ฉ์นœ ์ด ๋น„์šฉ์„ ์ตœ์†Œํ™”ํ•˜๋Š” ๊ฒƒ, ์ž‘์—…์žฅ ์ˆ˜๊ฐ€ ์ฃผ์–ด์ง„ ์ƒํ™ฉ์—์„œ ์‚ฌ์ดํด ์‹œ๊ฐ„์„ ์ตœ์†Œํ™”ํ•˜๋Š” ๊ฒƒ, ๊ทธ๋ฆฌ๊ณ  ์ •ํ•ด์ง„ ์ž‘์—…์žฅ ์•ˆ์—์„œ ์—…๋ฌด ๊ณผ๋ถ€ํ•˜๋ฅผ ์ตœ์†Œํ™”ํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ์ œ์•ˆ๋œ ๋ชจํ˜•๋“ค์€ ์ˆ™๋ จ๋œ ์ž‘์—…์ž์™€ ์ž„์‹œ ์ž‘์—…์ž๋ฅผ ๋™์‹œ์— ํ• ๋‹นํ•˜๋Š” ์‚ฌ์•ˆ๊ณผ ์ž‘์—…๋“ค ์‚ฌ์ด์˜ ์„ ํ–‰๊ด€๊ณ„ ๋“ฑ ์‹ค์ œ ํ˜„์žฅ์—์„œ ์ ์šฉ๋˜๋Š” ์‹ค์šฉ์  ํŠน์„ฑ๋“ค์„ ๊ณ ๋ คํ•˜๊ณ  ์žˆ๋‹ค. ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ, ์ด ๋น„์šฉ์„ ์ตœ์†Œํ™”ํ•  ์ˆ˜ ์žˆ๋Š” ๋ณตํ•ฉ์œ ์ „์•Œ๊ณ ๋ฆฌ์ฆ˜๋„ ๊ฐœ๋ฐœ๋˜์—ˆ๋‹ค. ํ•ด์˜ ํƒ€๋‹น์„ฑ์„ ๋ณด์žฅํ•˜๊ณ  ๋ณตํ•ฉ์œ ์ „์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ์šฐ์ˆ˜์„ฑ์„ ๋†’์ด๊ธฐ ์œ„ํ•ด ํŠน๋ณ„ํ•œ ์œ ์ „์—ฐ์‚ฐ์ž๋“ค๊ณผ ๋ฐœ๊ฒฌ์  ๊ธฐ๋ฒ•์ด ์‚ฌ์šฉ๋˜์—ˆ๋‹ค. ์ˆ˜์น˜์‹คํ—˜๋“ค์„ ํ†ตํ•ด์„œ ๋ณตํ•ฉ์œ ์ „์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ์šฐ์ˆ˜์„ฑ์„ ์ž…์ฆํ•˜๊ธฐ ์œ„ํ•˜์—ฌ ์ˆ˜ํ•™์  ๋ชจํ˜•๊ณผ ๋น„๊ตํ•˜์˜€๋‹ค.This study extends a single-model assembly line balancing problem to an integrated mixed-model assembly line balancing problem by incorporating temporary unskilled workers, who enhance productivity. Three mathematical models are developed to minimize the sum of total workstation costs, salaries of all workers, and cycle times and potential work overload of a predetermined number of workstations. The proposed models are based on particular features of the real-world problem, such as simultaneous assignments of skilled and temporary unskilled workers as well as precedent restrictions among the tasks. Furthermore, a hybrid genetic algorithm that minimizes total operation costs is developed. Special genetic operators and heuristic algorithms are used to ensure feasibility of solutions and make the hybrid genetic algorithm efficient. Computational experiments demonstrate the superiority of the hybrid genetic algorithm over the mathematical models.Chapter 1. Introduction 1 1.1 The assembly line 1 1.1.1 Characteristics of assembly line problem 1 1.1.2 Assembly line balancing problem 2 1.2 The mixed-model assembly line 3 1.2.1 Characteristics of mixed model assembly line problem 3 1.2.2 Mixed model assembly line balancing problem 4 1.3 Literature review 5 1.4 Contributions 9 Chapter 2. Mathematical Models 11 2.1 General features of mathematical models 11 2.2 Problem description 11 2.3 Model โ…  14 2.4 Model โ…ก 18 2.5 Model โ…ข 20 Chapter 3. A Hybrid Genetic Algorithm 23 3.1 Chromosome representation 24 3.2 Objective and fitness function 26 3.3 Genetic operator 27 3.3.1 Selection 27 3.3.2 Crossover 28 3.3.3 Mutation 29 3.4 Terminating conditions and parameters 30 Chapter 4. Computational Experiments 31 4.1 Experiments for Model โ…  39 4.2 Experiments for Model โ…ก 42 4.3 Experiments for Model โ…ข 46 4.4 Validation of a hybrid genetic algorithm 48 Chapter 5. Conclusions 50 Bibliography 51 Abstract 54Maste

    Integrating ant colony and genetic algorithms in the balancing and scheduling of complex assembly lines

    Get PDF
    Copyright ยฉ 2015 Springer. This is a PDF file of an unedited manuscript that has been accepted for publication in The International Journal of Advanced Manufacturing Technology. The final publication is available at: http://link.springer.com/article/10.1007/s00170-015-7320-y. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.Different from a large number of existing studies in the literature, this paper addresses two important issues in managing production lines, the problems of line balancing and model sequencing, concurrently. A novel hybrid agent-based ant colony optimizationโ€“genetic algorithm approach is developed for the solution of mixed model parallel two-sided assembly line balancing and sequencing problem. The existing agent-based ant colony optimization algorithm is enhanced with the integration of a new genetic algorithm-based model sequencing mechanism. The algorithm provides ants the opportunity of selecting a random behavior among ten heuristics commonly used in the line balancing domain. A numerical example is given to illustrate the solution building procedure of the algorithm and the evolution of the chromosomes. The performance of the developed algorithm is also assessed through test problems and analysis of their solutions through a statistical test, namely paired sample t test. In accordance with the test results, it is statistically proven that the integrated genetic algorithm-based model sequencing engine helps agent-based ant colony optimization algorithm robustly find significantly better quality solutions

    Multi-objective discrete particle swarm optimisation algorithm for integrated assembly sequence planning and assembly line balancing

    Get PDF
    In assembly optimisation, assembly sequence planning and assembly line balancing have been extensively studied because both activities are directly linked with assembly efficiency that influences the final assembly costs. Both activities are categorised as NP-hard and usually performed separately. Assembly sequence planning and assembly line balancing optimisation presents a good opportunity to be integrated, considering the benefits such as larger search space that leads to better solution quality, reduces error rate in planning and speeds up time-to-market for a product. In order to optimise an integrated assembly sequence planning and assembly line balancing, this work proposes a multi-objective discrete particle swarm optimisation algorithm that used discrete procedures to update its position and velocity in finding Pareto optimal solution. A computational experiment with 51 test problems at different difficulty levels was used to test the multi-objective discrete particle swarm optimisation performance compared with the existing algorithms. A statistical test of the algorithm performance indicates that the proposed multi-objective discrete particle swarm optimisation algorithm presents significant improvement in terms of the quality of the solution set towards the Pareto optimal set

    A note on โ€œA multi-objective genetic algorithm for solving assembly line balancing problemโ€

    Get PDF
    Assembly line balancing has a considerable place in industrial importance. Hence, a lot of researchers are interested in this subject and several papers have been published so far. Many exact, heuristic, metaheuristic, and hybrid approaches have been used to solve this type of problems. Recently Ponnanbalam et al. (Int J Adv Manuf Technol 16:341โ€“352, 2000) have considered a multi-objective genetic algorithm utilizing several simple heuristic rules for solving the simple assembly line balancing problems, one of these rules was โ€œrank positional weight (RPW)โ€ originally published in Helgeson and Birnie (J Ind Eng 12(6):394โ€“398, 1961). Through providing two possible justifications, this note suggests that the mentioned rule can be mistakenly utilized and some revisions in Ponnanbalam et al. (Int J Adv Manuf Technol 16:341โ€“352, 2000) seem to be necessary

    Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms

    Full text link
    The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of theoptimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies

    An integrated representation scheme for assembly sequence planning and assembly line balancing

    Get PDF
    In a typical assembly optimisation, Assembly Sequence Planning and Assembly Line Balancing are performed independently. However, competition has compelled the manufacturer to innovate by integrating the optimisation of both problems. To incorporate ASP and ALB optimisations into a single integrated optimisation, a clear prerequisite is the availability of integrated ASP and ALB representation. Although many assembly representation works has been proposed, none of them fully meet the requirements of integrated optimisation because they were developed independently from various needs. In this paper, an integrated representation scheme for ASP and ALB that incorporate essential optimisation information is developed. The proposed representation scheme is built based on assembly tasks and represented using precedence graph and data matrix. The outcome from presented example showed that the information for ASP and ALB optimisation can be integrated and represented using task based precedence graph and data matrix, without discarding important attributes
    • โ€ฆ
    corecore