首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The assembly line balancing problem is a non deterministic polynomial type planning problem for mass production. Layout design changes constitute a major decision that yields investment for assembly operations and numerous heuristics have been reported in the literature for solving the line balancing problems. U-shaped assembly layout offers several benefits over traditional straight-line layout in implementation of lean manufacturing and Just-In-Time technology. In the paper an attempt has been made to evaluate labor productivity in U-shaped line system and straight line system. A Critical Path Method (CPM) based approach for U-shaped assembly line has been applied for assigning the task to the work stations for assembly line layout. Results show that the CPM based U-shaped approach performs better and improve the labor productivity of assembly line layout.  相似文献   

2.
3.
This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.  相似文献   

4.
Designing and operating two-sided assembly lines are crucial for manufacturing companies which assemble large-sized products such as trucks, buses and industrial refrigerators. This type of assembly line structure has several advantages over one-sided assembly lines such as shortened line length and reduced throughput time. The research area has recently focused on balancing two-sided assembly lines owing to these advantages. However, due to the complex structure of this problem, some practical constraints have been disregarded or have not been fully incorporated. In order to overcome these deficiencies, a fully constrained two-sided assembly line balancing problem is addressed in this research paper. Initially, a mathematical programming model is presented in order to describe the problem formally. Due to the problem complexity, two different swarm intelligence based search algorithms are implemented to solve large-sized instances. Bees algorithm and artificial bee colony algorithm have been applied to the fully constrained two-sided assembly line balancing problem so as to minimize the number of workstations and to obtain a balanced line. An extensive computational study has also been performed and the comparative results have been evaluated.  相似文献   

5.
Two-sided assembly lines are especially used at the assembly of large-sized products, such as trucks and buses. In this type of a production line, both sides of the line are used in parallel. In practice, it may be necessary to optimize more than one conflicting objectives simultaneously to obtain effective and realistic solutions. This paper presents a mathematical model, a pre-emptive goal programming model for precise goals and a fuzzy goal programming model for imprecise goals for two-sided assembly line balancing. The mathematical model minimizes the number of mated-stations as the primary objective and it minimizes the number of stations as a secondary objective for a given cycle time. The zoning constraints are also considered in this model, and a set of test problems taken from literature is solved. The proposed goal programming models are the first multiple-criteria decision-making approaches for two-sided assembly line balancing problem with multiple objectives. The number of mated-stations, cycle time and the number of tasks assigned per station are considered as goals. An example problem is solved and a computational study is conducted to illustrate the flexibility and the efficiency of the proposed goal programming models. Based on the decision maker's preferences, the proposed models are capable of improving the value of goals.  相似文献   

6.
To respond to the challenge of agile manufacturing, companies are striving to provide a large variety of products at low cost. Product modularity has become an important issue. It allows to produce different products through combination of standard components. One of the characteristics of modular products is that they share the same assembly structure for many assembly operations. The special structure of modular products provides challenges and opportunities for operational design of assembly lines. In this paper, an approach for design of assembly lines for modular products is proposed. This approach divides the assembly line into two subassembly lines: a subassembly line for basic assembly operations and a subassembly line for variant assembly operations. The design of the subassembly line for basic operations can be viewed as a single product assembly line balancing problem and be solved by existing line balancing methods. The subassembly line for the variant operations is designed as a two-station flowshop line and is balanced by a two-machine flowshop scheduling method. A three-station flowshop line for a special structure of modular products is proposed and illustrated with an example.  相似文献   

7.
蚁群算法求解装配线平衡第一类问题   总被引:2,自引:0,他引:2  
装配线平衡问题是生产管理中重要且较难解决的问题,其中第一类问题是装配线平衡问题的关键问题。本文通过对装配线平衡问题的分析与建模,提出了利用蚁群算法这种人工智能优化算法求解一般装配线平衡第一类问题的步骤和算法。采用启发式的方法构造分配方案的生成策略,并对信息素的更新采用局部更新与全局更新相结合的规则,从而使得该算法具有较好的目的性,大大提高了获得最优解的效率。通过该蚁群算法能得到装配线平衡第一类问题质量较优的解,且有速度快、鲁棒性、通用性等优势。  相似文献   

8.
Assembly line balancing plays a crucial role in modern manufacturing companies in terms of the growth in productivity and reduction in costs. The problem of assigning tasks to consecutive stations in such a way that one or more objectives are optimized subject to the required tasks, processing times and some specific constraints is called the assembly line balancing problem (ALBP). Depending on production tactics and distinguishing working conditions in practice, assembly line systems show a large diversity. Although, a growing number of researchers addressed ALBP over the past fifty years, real-world assembly systems which require practical extensions to be considered simultaneously have not been adequately handled. This study deals with an industrial assembly system belonging to the class of two-sided line with additional assignment restrictions which are often encountered in practice. Teaching–learning based optimization (TLBO), which is a recently developed nature-inspired search method, is employed to solve the line balancing problem. Computational results are compared with the current situation in terms of the line efficiency, and the solution structure with workload assigned to the stations is presented.  相似文献   

9.
Assembly line balancing problems with multi-manned workstations usually occur in plants producing high volume products (e.g. automotive industry) in which the size of the product is reasonably large to utilize the multi-manned assembly line configuration. In these kinds of assembly lines, usually there are multi-manned workstations where a group of workers simultaneously performs different operations on the same individual product. However, owing to the high computational complexity, it is quite difficult to achieve an optimal solution to the balancing problem of multi-manned assembly lines with traditional optimization approaches. In this study, a simulated annealing heuristic is proposed for solving assembly line balancing problems with multi-manned workstations. The line efficiency, line length and the smoothness index are considered as the performance criteria. The proposed algorithm is illustrated with a numerical example problem, and its performance is tested on a set of test problems taken from literature. The performance of the proposed algorithm is compared to the existing approaches. Results show that the proposed algorithm performs well.  相似文献   

10.
Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have been proposed, leading to the different performances of these algorithms and unfair comparison. In this paper, two new decoding schemes with reduced search space are developed to balance the workload within a mated-station and reduce sequence-depended idle time. Then, graded objectives are employed to preserve the minor improvements on the solutions. Finally, a simple iterated greedy algorithm is extended for the two-sided assembly line balancing problem and modified NEH-based heuristic is introduced to obtain a high quality initial solution. And an improved local search with referenced permutation and reduced insert operators is developed to accelerate the search process. Computational results on benchmark problems prove the efficiency of the proposed decoding schemes and the new graded objectives. A comprehensive computational comparison among 14 meta-heuristics is carried out to demonstrate the efficiency of the improved iterated greedy algorithm.  相似文献   

11.
The lexicographic bottleneck assembly line balancing problem is a recently introduced problem which aims at obtaining a smooth workload distribution among workstations. This is achieved hierarchically. The workload of the most heavily loaded workstation is minimised, followed by the workload of the second most heavily loaded workstation and so on. This study contributes to knowledge by examining the application of the lexicographic bottleneck objective on mixed-model lines, where more than one product model is produced in an inter-mixed sequence. The main characteristics of the lexicographic bottleneck mixed-model assembly line balancing problem are described with numerical examples. Another contribution of the study is the methodology used to deal with the complex structure of the problem. Two effective meta-heuristic approaches, namely artificial bee colony and tabu search, are proposed. The parameters of the proposed meta-heuristics are optimised using response surface methodology, which is a well-known design of experiments technique, as a unique contribution to the expert and intelligent systems literature. Different from the common tendency in the literature (which aims to optimise one parameter at a time), all parameters are optimised simultaneously. Therefore, it is shown how a complex production planning problem can be solved using sophisticated artificial intelligence techniques with optimised parameters. The methodology used for parameter setting can be applied to other metaheuristics for solving complex problems in practice. The performances of both algorithms are assessed using well-known test problems and it is observed that both algorithms find promising solutions. Artificial bee colony algorithm outperforms tabu search in minimising the number of workstations while tabu search shows a better performance in minimising the value of lexicographic bottleneck objective function.  相似文献   

12.
We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer program theoretically dominates all previous formulations using impulse variables, and produces solutions of significantly better quality in practice. The improved formulation can be used to strengthen related problems with similar restrictions. We demonstrate their effectiveness on the U‐shaped assembly line balancing problem and on the bin packing problem with precedence constraints.  相似文献   

13.
Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. In addition to their multi-criteria nature, the different problems included in this field inherit the precedence constraints and the cycle time limitations from assembly line balancing problems, which altogether make them very hard to solve. Therefore, time and space assembly line balancing problems have been mainly tackled using multiobjective constructive metaheuristics. Global search algorithms in general - and multiobjective genetic algorithms in particular - have shown to be ineffective to solve them up to now because the existing approaches lack of a proper design taking into account the specific characteristics of this family of problems. The aim of this contribution is to demonstrate the latter assumption by proposing an advanced multiobjective genetic algorithm design for the 1/3 variant of the time and space assembly line balancing problem which involves the joint minimization of the number and the area of the stations given a fixed cycle time limit. This novel design takes the well known NSGA-II algorithm as a base and considers the use of a new coding scheme and sophisticated problem specific operators to properly deal with the said problematic questions. A detailed experimental study considering 10 different problem instances (including a real-world instance from the Nissan plant in Barcelona, Spain) will show the good yield of the new proposal in comparison with the state-of-the-art methods.  相似文献   

14.
Multi-criteria decision making for assembly line balancing   总被引:1,自引:0,他引:1  
Assembly line balancing often has significant impact on performance of manufacturing systems, and is usually a multiple-objective problem. Neither an algorithmic nor a procedural assembly line balancing methodology is usually effective in solving these problems. This article proposes a data envelopment analysis (DEA) approach to solve an assembly line balancing problem. A computer-aided assembly line balancing tool as Flexible Line Balancing software is used to generate a considerable number of solutions alternatives as well as to generate quantitative decision-making unit outputs. The quantitative performance measures were considered in this article. Then DEA was used to solve the multiple-objective assembly line balancing problem. An illustrative example shows the effectiveness of the proposed methodology.  相似文献   

15.
为了解决航空发动机装配过程中存在的不确定返工问题,建立了面向航空发动机装配线的知识化制造系统(knowledgeable manufacturing system,KMS)重调度和班组自重构优化模型,提出装配线重调度及自重构集成优化算法.在算法调度层,证明了以加权完工成本为优化目标的工序排序性质,并对工序进行初始排序.定义了3种邻域结构,用变邻域搜索(variable neighborhood search,VNS)对工序在并行装配组上的指派问题和调度问题进行优化.在重构层,在不违背装配组装配技能约束的前提下利用装配线负载平衡原则对装配班组进行配置,并采用禁忌搜索(tabu search,TS)对班组配置进行优化.仿真实验结果表明了模型与算法的有效性.  相似文献   

16.
Assembly line balancing is the problem of assigning tasks to workstations by optimizing a performance measure while satisfying precedence relations between tasks and cycle time restrictions. Many exact, heuristic and metaheuristic approaches have been proposed for solving simple straight and U-shaped assembly line balancing problems. In this study, a relatively new optimization algorithm, Bacterial Foraging Optimization Algorithm (BFOA), based heuristic approach is proposed for solving simple straight and U-shaped assembly line balancing problems. The performance of the proposed algorithm is evaluated using a well-known data set taken from the literature in which the number of tasks varies between 7 and 111, and results are also compared with both an ant-colony-optimization-based heuristic approach and a genetic-algorithm-based heuristic approach. The proposed algorithm provided optimal solutions for 123 out of 128 (96.1 %) test problems in seconds and is proven to be promising.  相似文献   

17.
In a robotic assembly line, a series of stations are arranged along a conveyor belt and a robot performs on tasks at each station. Parallel assembly lines can provide improving line balance, productivity and so on. Combining robotic and parallel assembly lines ensure increasing flexibility of system, capacity and decreasing breakdown sensitivity. Although aforementioned benefits, balancing of robotic parallel assembly lines is lacking – to the best knowledge of the authors- in the literature. Therefore, a mathematical model is proposed to define/solve the problem and also iterative beam search (IBS), best search method based on IBS (BIBS) and cutting BIBS (CBIBS) algorithms are presented to solve the large-size problem due to the complexity of the problem. The algorithm also tested on the generated benchmark problems for robotic parallel assembly line balancing problem. The superior performances of the proposed algorithms are verified by using a statistical test. The results show that the algorithms are very competitive and promising tool for further researches in the literature.  相似文献   

18.
在现代化大规模大批量的流水装配制造业中,数量众多的作用分配和多工位的合理安排使工位平衡问题显得更为突出。针对第一类工位平衡问题,即在给定的生产节拍下最小化工位数,首先分析了该问题并建立了数学模型,进而提出了一种基于改进遗传算法求解工位平衡问题的方法。该算法以焊接任务的操作顺序优先关系为约束前提,在初始种群的生产以及交叉和变异过程中保证了染色体解的可行性,同时在遗传算法的选择过程中考虑了具有相同工位数的最优作业方案的工时标准差,从而提高了算法的搜索效率和解的可靠性。最后通过实例求解验证了该算法的有效性。  相似文献   

19.
In this study a new multi-objective assembly line balancing problem is studied. Objectives like the number of stations, the equipment purchasing cost, the worker time dependent wage, and worker dependent dis-quality level of the stations is to be minimized simultaneously with worker allocation and equipment assignment possibilities. The problem also is formulated in a fuzzy environment. To solve such problem, a new hybrid fuzzy interactive approach is proposed in two stages. In the first stage, the fuzzy formulation is converted to a crisp multi-objective formulation using a credibility-based chance constrained programming approach. Then in the second stage, the obtained crisp multi-objective formulation is solved by a new hybrid fuzzy programming approach. To evaluate the proposed approach, two generated examples and a case study from garment production industries are used for computational experiments. The extensive computational study prove the superiority of the proposed approach over the well-known approaches of the literature.  相似文献   

20.
A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing large products such as trucks and buses. This paper presents a mathematical model and a genetic algorithm (GA) for two-sided assembly line balancing (two-ALB). The mathematical model can be used as a foundation for further practical development in the design of two-sided assembly lines. In the GA, we adopt the strategy of localized evolution and steady-state reproduction to promote population diversity and search efficiency. When designing the GA components, including encoding and decoding schemes, procedures of forming the initial population, and genetic operators, we take account of the features specific to two-ALB. Through computational experiments, the performance of the proposed GA is compared with that of a heuristic and an existing GA with various problem instances. The experimental results show that the proposed GA outperforms the heuristic and the compared GA.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号