期刊文献+
共找到10篇文章
< 1 >
每页显示 20 50 100
Genetic Algorithm for Concurrent Balancing of Mixed-Model Assembly Lines with Original Task Times of Models 被引量:1
1
作者 Panneerselvam Sivasankaran Peer Mohamed Shahabudeen 《Intelligent Information Management》 2013年第3期84-92,共9页
The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem a... The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem. 展开更多
关键词 assembly line Balancing Cycle Time GENETIC Algorithm CROSSOVER Operation mixed-model
下载PDF
Mixed-Model U-Shaped Assembly Line Balancing Problems with Coincidence Memetic Algorithm
2
作者 Parames Chutima Panuwat Olanviwatchai 《Journal of Software Engineering and Applications》 2010年第4期347-363,共17页
Mixed-model U-shaped assembly line balancing problems (MMUALBP) is known to be NP-hard resulting in it being nearly impossible to obtain an optimal solution for practical problems with deterministic algorithms. This p... Mixed-model U-shaped assembly line balancing problems (MMUALBP) is known to be NP-hard resulting in it being nearly impossible to obtain an optimal solution for practical problems with deterministic algorithms. This paper pre-sents a new evolutionary method called combinatorial optimisation with coincidence algorithm (COIN) being applied to Type I problems of MMUALBP in a just-in-time production system. Three objectives are simultaneously considered;minimum number workstations, minimum work relatedness, and minimum workload smoothness. The variances of COIN are also proposed, i.e. CNSGA II, and COIN-MA. COIN and its variances are tested against a well-known algo-rithm namely non-dominated sorting genetic algorithm II (NSGA II) and MNSGA II (a memetic version of NSGA II). Experimental results showed that COIN outperformed NSGA II. In addition, although COIN-MA uses a marginal CPU time than CNSGA II, its other performances are dominated. 展开更多
关键词 assembly line Balancing mixed-model U-line JIT COIN
下载PDF
Heuristics for Mixed Model Assembly Line Balancing Problem with Sequencing
3
作者 Panneerselvam Sivasankaran Peer Mohamed Shahabudeen 《Intelligent Information Management》 2016年第3期41-65,共25页
The growing global competition compels organizations to use many productivity improvement techniques. In this direction, assembly line balancing helps an organization to design its assembly line such that its balancin... The growing global competition compels organizations to use many productivity improvement techniques. In this direction, assembly line balancing helps an organization to design its assembly line such that its balancing efficiency is maximized. If the organization assembles more than one model in the same line, then the objective is to maximize the average balancing efficiency of the models of the mixed model assembly line balancing problem. Maximization of average balancing efficiency of the models along with minimization of makespan of sequencing models forms a multi-objective function. This is a realistic objective function which combines the balancing efficiency and makespan. This assembly line balancing problem with multi-objective comes under combinatorial category. Hence, development of meta-heuristic is inevitable. In this paper, an attempt has been made to develop three genetic algorithms for the mixed model assembly line balancing problem such that the average balancing efficiency of the model is maximized and the makespan of sequencing the models is minimized. Finally, these three algorithms and another algorithm in literature modified to solve the mixed-model assembly line balancing problem are compared in terms of the stated multi-objective function using a randomly generated set of problems through a complete factorial experiment. 展开更多
关键词 assembly line Balancing Genetic Algorithm Crossover Operation mixed-model Model Sequencing MAKESPAN
下载PDF
Part Supply Method for Mixed-Model Assembly Lines with Decentralized Supermarkets 被引量:6
4
作者 Jietao Dong Linxuan Zhang Tianyuan Xiao 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2016年第4期426-434,共9页
In-house part supply affects the efficiency of mixed-model assembly lines considerably. Hence, we propose a reliable Just-In-Time part supply strategy with the use of decentralized supermarkets. For a given production... In-house part supply affects the efficiency of mixed-model assembly lines considerably. Hence, we propose a reliable Just-In-Time part supply strategy with the use of decentralized supermarkets. For a given production sequence and line layout, the proposed strategy schedules tow train routing and delivery problems jointly to minimize the number of employed town trains and the traveling time, while ensuring that stations never run out of parts. To solve this problem, a mathematical formulation is proposed for each sub-problem aiming at minimizing supply cost. Then, a dynamic programming algorithm for routing and a greedy algorithm for delivery are developed, both of which are of polynomial runtime. Finally, a computational study is implemented to validate the effectiveness of the strategy, and to investigate the effects of the delivery capacity of tow trains and storage capacity of stations on supply cost. 展开更多
关键词 part supply mixed-model assembly lines SUPERMARKET dynamic programming greedy algorithm
原文传递
Hybrid genetic algorithm for a type-Ⅱ robust mixed-model assembly line balancing problem with interval task times 被引量:3
5
作者 Jia-Hua Zhang Ai-Ping Li Xue-Mei Liu 《Advances in Manufacturing》 SCIE CAS CSCD 2019年第2期117-132,共16页
The typemixed-model assembly line balancing problem with uncertain task times is a critical problem. This paper addresses this issue of practical significance to production efficiency. Herein, a robust optimization mo... The typemixed-model assembly line balancing problem with uncertain task times is a critical problem. This paper addresses this issue of practical significance to production efficiency. Herein, a robust optimization model for this problem is formulated to hedge against uncertainty. Moreover, the counterpart of the robust optimization model is developed by duality. A hybrid genetic algorithm (HGA) is proposed to solve this problem. In this algorithm, a heuristic method is utilized to seed the initial population. In addition, an adaptive local search procedure and a discrete Levy flight are hybridized with the genetic algorithm (GA) to enhance the performance of the algorithm. The effectiveness of the HGA is tested on a set of benchmark instances. Furthermore, the effect of uncertainty parameters on production efficiency is also investigated. 展开更多
关键词 mixed-model assembly line assembly line balancing ROBUST optimization GENETIC algorithm (GA) Uncertainty
原文传递
AN OPTIMAL KANBAN SYSTEM IN A MULTI-STAGE,MIXED-MODEL ASSEMBLY LINE 被引量:2
6
作者 Lei YANG~1 Xiaopeng ZHANG~2 Mingyue JIANG~3 School of Business Administration,South China University of Technology Guangzhou 510640,China 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2010年第1期36-49,共14页
This paper studies the parameter design and the performance optimization of a Kanban system without stockouts in a multi-stage, mixed-model assembly line. The model of a Kanban system based on production processes is ... This paper studies the parameter design and the performance optimization of a Kanban system without stockouts in a multi-stage, mixed-model assembly line. The model of a Kanban system based on production processes is established by examining the relationship among the set-up time, the amount of work in process (WIP), the capacity indicated by a Kanban, and the takt-time ratio. A novel method for optimizing performance on the premise of no stockouts is proposed. Empirical results show that the amount of WIP is reduced remarkably after optimization. 展开更多
关键词 MULTI-STAGE mixed-model assembly line Kanban management amount of WIP one-piece flow
原文传递
Sequencing Mixed-Model Flexible Assembly Lines with Variable Launching Intervals 被引量:1
7
作者 童科娜 徐克林 郑永前 《Journal of Shanghai Jiaotong university(Science)》 EI 2013年第4期460-467,共8页
To solve the sequencing problem in mixed-model flexible assembly lines (MMFALs) with variable launching intervals, a mathematical model aiming to minimize the cost of utility and idle times is developed. To obtain hig... To solve the sequencing problem in mixed-model flexible assembly lines (MMFALs) with variable launching intervals, a mathematical model aiming to minimize the cost of utility and idle times is developed. To obtain high-quality sequences, an advanced scatter search (ASS) algorithm is proposed. A heuristic approach, i.e. launching intervals between products algorithm (LIBPA), is incorporated into the ASS algorithm to solve the launching interval problem for each sequence. Numerical experiments with different scales are conducted to compare the performance of ASS with genetic algorithm (GA). In addition, we compare the cost of variable launching intervals approach with fixed launching intervals approach. The results indicate that the ASS is efficient and effective, and considering variable launching intervals in mixed-model assembly lines (MMALs) sequencing problem can improve the performance of the line. 展开更多
关键词 variable launching intervals mixed-model assembly line (MMAL) FLEXIBLE SEQUENCING scatter search algorithm
原文传递
A dynamic delivery strategy for material handling in mixed-model assembly lines using decentralized supermarkets
8
作者 Jietao Dong Linxuan Zhang +1 位作者 Tianyuan Xiao Hui Li 《International Journal of Modeling, Simulation, and Scientific Computing》 EI 2015年第4期73-91,共19页
Material handling has become one of the major challenges in modern production management.Consequently,this paper intends to investigate the part delivery of mixedmodel assembly lines with decentralized supermarkets an... Material handling has become one of the major challenges in modern production management.Consequently,this paper intends to investigate the part delivery of mixedmodel assembly lines with decentralized supermarkets and tow trains.Besides,uncertain exception disturbances,including tow train failures and adjustments of the production sequence,are also considered.To solve this problem,a heuristic-based dynamic delivery strategy is proposed,which dynamically schedules the route,departure time,quantities and types of loaded parts for each tour.To evaluate the performance of this strategy,it is used to solve an instance in comparison with the periodic delivery strategy,experimental results are reported and their performances are compared under different metrics.Moreover,a multi-scenario analysis is employed to determinate the long-term decisions,including the number of tow trains and the route layout.Finally,the critical storage is suggested to be set for each station to avoid part starvation resulting from disturbances,and its effect on the delivery performance is investigated. 展开更多
关键词 mixed-model assembly lines dynamic part delivery SUPERMARKET tow train critical storage.
原文传递
Minimizing Products Rates Variation in Just-in-Time Mixed-Model Manufacturing
9
作者 Ghorbanali Mohammadi Darius Mohammadi 《American Journal of Operations Research》 2016年第2期147-152,共6页
Mixed-Model assembly lines are often used in manufacturing based on just-in-time techniques. The effective utilization of these lines requires a schedule for assembling the different models be determined. The objectiv... Mixed-Model assembly lines are often used in manufacturing based on just-in-time techniques. The effective utilization of these lines requires a schedule for assembling the different models be determined. The objective is to minimize the total deviation of actual production rates from the desired production rates. Mathematical method with the optimization algorithm is proposed here to solve this problem. To prove the efficiency of the proposed algorithm, a number of test problems are solved. The results show that the proposed algorithm is an efficient and effective algorithm which gives better results with the large problem sizes. This paper presents a practical procedure to minimize total product variation rates, and easy to use by practitioner. 展开更多
关键词 mixed-model assembly lines JIT SCHEDULING Optimization MANUFACTURING
下载PDF
求解多目标混流装配线平衡问题的VPS-PSO算法 被引量:7
10
作者 刘冬 张卫 陆宝春 《机械设计与制造》 北大核心 2019年第2期257-260,共4页
为了更有效地减少工作站数目、提高装配线效率,提出了一种基于多目标混流装配线平衡问题的方法。针对混流装配线平衡问题,采用工作站损失指数、装配线损失效率和平滑指数的评价指标作为混流装配线平衡优化问题的适应度函数,在给定节拍... 为了更有效地减少工作站数目、提高装配线效率,提出了一种基于多目标混流装配线平衡问题的方法。针对混流装配线平衡问题,采用工作站损失指数、装配线损失效率和平滑指数的评价指标作为混流装配线平衡优化问题的适应度函数,在给定节拍和装配优先顺序的前提下建立多目标优化模型。提出一种基于变种群策略的改进粒子群(VPS-PSO)算法能有效地维持种群的多样性,提高粒子群算法的全局搜索寻优能力。案例表明,该算法相对于PSO算法具有更好的寻优能力和求解效率,可以更高效地得到合理的装配线平衡方案。 展开更多
关键词 混流装配线平衡问题 粒子群算法 变种群策略 多目标优化
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部