共查询到20条相似文献,搜索用时 46 毫秒
1.
Assembly lines play a crucial role in determining the profitability of a company. Market conditions have increased the importance of mixed-model assembly lines. Variations in the demand are frequent in real industrial environments and often leads to failure of the mixed-model assembly line balancing scheme. Decision makers have to take into account this uncertainty. In an assembly line balancing problem, there is a massive amount of research in the literature assuming deterministic environment, and many other works consider uncertain task times. This research utilises the uncertainty theory to model uncertain demand and introduces complexity theory to measure the uncertainty of assembly lines. Scenario probability and triangular fuzzy number are used to describe the uncertain demand. The station complexity was measured based on information entropy and fuzzy entropy to assist in balancing systems with robust performances, considering the influence of multi-model products in the station on the assembly line. Taking minimum station complexity, minimum workload difference within station, maximum productivity as objective functions, a new optimization model for mixed-model assembly line balancing under uncertain demand was established. Then an improved genetic algorithm was applied to solve the model. Finally, the effectiveness of the model was verified by several instances of mixed-model assembly line for automobile engine. 相似文献
2.
The sequencing and line balancing of manual mixed-model assembly lines are challenging tasks due to the complexity and uncertainty of operator activities. The control of cycle time and the sequencing of production can mitigate the losses due to non-optimal line balancing in the case of open-station production where the operators can work ahead of schedule and try to reduce their backlog. The objective of this paper is to provide a cycle time control algorithm that can improve the efficiency of assembly lines in such situations based on a specially mixed sequencing strategy. To handle the uncertainty of activity times, a fuzzy model-based solution has been developed. As the production process is modular, the fuzzy sets represent the uncertainty of the elementary activity times related to the processing of the modules. The optimistic and pessimistic estimates of the completion of activity times extracted from the fuzzy model are incorporated into a model predictive control algorithm to ensure the constrained optimization of the cycle time. The applicability of the proposed method is demonstrated based on a wire-harness manufacturing process with a paced conveyor, but the proposed algorithm can handle continuous conveyors as well. The results confirm that the application of the proposed algorithm is widely applicable in cases where a production line of a supply chain is not well balanced and the activity times are uncertain. 相似文献
3.
Balancing and scheduling of flexible mixed model assembly lines 总被引:1,自引:0,他引:1
Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an operational problem. In this paper, we propose mixed integer programming (MIP) and constraint programming (CP) models which consider both balancing and model sequencing within the same formulation along with the optimal schedule of tasks at a station. Furthermore, we also compare the proposed exact models with decomposition schemes developed for solving different instances of varying sizes. This is the first paper in the literature which takes into account the network type precedence diagrams and limited buffer capacities between stations. Besides, it is the first study that CP method is applied to balancing and scheduling of mixed model assembly lines. Our empirical study shows that the CP approach outperforms the MIP approach as well as the decomposition schemes. 相似文献
4.
The consideration of this paper is given to address the straight and U-shaped assembly line balancing problem. Although many attempts in the literature have been made to develop deterministic version of the assembly line model, the attention is not considerably given to those in uncertain environment. In this paper, a novel bi-objective fuzzy mixed-integer linear programming model (BOFMILP) is developed so that triangular fuzzy numbers (TFNs) are employed in order to represent uncertainty and vagueness associated with the task processing times in the real production systems. In this proposed model, two conflicting objectives (minimizing the number of stations as well as cycle time) are considered simultaneously with respect to set of constraints. For this purpose, an appropriate strategy in which new two-phase interactive fuzzy programming approach is proposed as a solution method to find an efficient compromise solution. Finally, validity of the proposed model as well as its solution approach are evaluated though numerical examples. In addition, a comparison study is conducted over some test problems in order to assess the performance of the proposed solution approach. The results demonstrate that our proposed interactive fuzzy approach not only can be applied in ALBPs but also is capable to handle any practical MOLP models. Moreover, in light of these results, the proposed model may constitute a framework aiming to assist the decision maker (DM) to deal with uncertainty in assembly line problem. 相似文献
5.
给出了用于求解装配线平衡的遗传算法。在此基础上,分析了装配线平衡系统的功能和工作机理。并采用面向对象语言开发了装配线平衡系统。最后将此系统用于某装配线的平衡,并依据平衡结果进行仿真,证明该算法效果较好。利用该系统可以有效地解决装配线平衡问题,大大降低成本,为提高装配线的生产效率和改进装配线提供了技术依据。 相似文献
6.
7.
Abdolreza Roshani Arezoo Roshani Abdolhassan Roshani Mohsen Salehi Azadeh Esfandyari 《Journal of Manufacturing Systems》2013
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
Yunfan Zhang Feng Liu Yifan Su Yue Chen Zhaojian Wang Jo?o P.S.Catal?o 《IEEE/CAA Journal of Automatica Sinica》2022,9(7):1295-1306
In the conventional robust optimization(RO)context, the uncertainty is regarded as residing in a predetermined and fixed uncertainty set. In many applications, however,uncertainties are affected by decisions, making the current RO framework inapplicable. This paper investigates a class of twostage RO problems that involve decision-dependent uncertainties.We introduce a class of polyhedral uncertainty sets whose righthand-side vector has a dependency on the here-and-now decisions and seek to deri... 相似文献
11.
This paper presents a robust model predictive control algorithm with a time‐varying terminal constraint set for systems with model uncertainty and input constraints. In this algorithm, the nonlinear system is approximated by a linear model where the approximation error is considered as an unstructured uncertainty that can be represented by a Lipschitz nonlinear function. A continuum of terminal constraint sets is constructed off‐line, and robust stability is achieved on‐line by using a variable control horizon. This approach significantly reduces the computational complexity. The proposed robust model predictive controller with a terminal constraint set is used in tracking set‐points for nonlinear systems. The effectiveness of the proposed method is illustrated with a numerical example. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
12.
Emre Cevikcan M. Bulent Durmusoglu Murat E. Unal 《Computers & Industrial Engineering》2009,56(2):576-599
Team-oriented approaches are widely being used in modern real life assembly systems, as are other modern systems. In this paper, first the literature of single and mixed model assembly line balancing, which plays an important role for the design of assembly systems, is reviewed. The associated literature matrixes reveal that team-oriented approaches do not have an intensive research area. Second, a team-oriented mathematical programming model for creating assembly teams (physical stations) in mixed model assembly lines is devised. Owing to the fact that this model is NP hard, a scheduling based heuristic algorithm is developed. The mixed model assembly line design methodology, which includes a team-oriented algorithm as a step, is proposed. Both model sequencing and worker transfer systems are included in the methodology. The algorithms for each step of the methodology are also coded by using MATLAB and MS Excel is used as the user interface. Furthermore, the presented methodology was applied in a chosen segment of a real life mixed model tractor assembly system. 相似文献
13.
In this study, we consider the assembly line worker assignment and balancing problem of type-II (ALWABP-2). ALWABP-2 arises when task times differ depending on operator skills and concerns with the assignment of tasks and operators to stations in order to minimize the cycle time. We developed an iterative genetic algorithm (IGA) to solve this problem. In the IGA, three search approaches are adopted in order to obtain search diversity and efficiency: modified bisection search, genetic algorithm and iterated local search. When designing the IGA, all the parameters such as construction heuristics, genetic operators and local search operators are adapted specifically to the ALWABP-2. The performance of the proposed IGA is compared with heuristic and metaheuristic approaches on benchmark problem instances. Experimental results show that the proposed IGA is very effective and robust for a large set of benchmark problems. 相似文献
14.
The paper describes methods for using Extremal Optimization (EO) for processor load balancing during execution of distributed applications. A load balancing algorithm for clusters of multicore processors is presented and discussed. In this algorithm the EO approach is used to periodically detect the best tasks as candidates for migration and for a guided selection of the best computing nodes to receive the migrating tasks. To decrease the complexity of selection for migration, the embedded EO algorithm assumes a two-step stochastic selection during the solution improvement based on two separate fitness functions. The functions are based on specific models which estimate relations between the programs and the executive hardware. The proposed load balancing algorithm is assessed by experiments with simulated load balancing of distributed program graphs. The algorithm is compared against a greedy fully deterministic approach, a genetic algorithm and an EO-based algorithm with random placement of migrated tasks. 相似文献
15.
An advanced multiobjective genetic algorithm design for the time and space assembly line balancing problem 总被引:1,自引:0,他引:1
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. 相似文献
16.
Balancing U-type assembly lines under uncertainty is addressed in this paper by formulating a robust problem and developing its optimization model and algorithm. U-type assembly layouts are shown to be more efficient than conventional straight lines. A great majority of studies on U-lines assume deterministic environments and ignore uncertainty in operation times. We aim to fill this research gap and, to the best of our knowledge, this study will be the first application of robust optimization to U-type assembly planning.We assume that the operation times are not fixed but they can vary. We employ robust optimization that considers worst case situations. To avoid over-pessimism, we consider that only a subset of operation times take their worst case values. To solve this problem, we suggest an iterative approximate solution algorithm. The efficiency of the algorithm is evaluated with some computational tests. 相似文献
17.
Assembly line balancing is important for the efficiency of the assembly process, however, a wide range of disruptions can break the current workload balance. Some researchers explored the task assignment plan for the assembly line balancing problem with the assumption that the assembly process is smooth with no disruption. Other researchers considered the impacts of disruptions, but they only explored the task re-assignment solutions for the assembly line re-balancing problem with the assumption that the re-balancing decision has been made already. There is limited literature exploring on-line adjustment solutions (layout adjustment and production rate adjustment) for an assembly line in a dynamic environment. This is because real-time monitoring of an assembly process was impossible in the past, and it is difficult to incorporate uncertainty factors into the balancing process because of the randomness and non-linearity of these factors. However, Industry 4.0 breaks the information barriers between different parts of an assembly line, since smart, connected products, which are enabled by advanced information and communication technology, can intelligently interact and communicate with each other and collect, process and produce information. Smart control of an assembly line becomes possible with the large amounts of real-time production data in the era of Industry 4.0, but there is little literature considering this new context. In this study, a fuzzy control system is developed to analyze the real-time information of an assembly line, with two types of fuzzy controllers in the fuzzy system. Type 1 fuzzy controller is used to determine whether the assembly line should be re-balanced to satisfy the demand, and type 2 fuzzy controller is used to adjust the production rate of each workstation in time to eliminate blockage and starvation, and increase the utilization of machines. Compared with three assembly lines without the proposed fuzzy control system, the assembly line with the fuzzy control system performs better, in terms of blockage ratio, starvation ratio and buffer level. Additionally, with the improvement of information transparency, the performance of an assembly line will be better. The research findings shed light on the smart control of the assembly process, and provide insights into the impacts of Industry 4.0 on assembly line balancing. 相似文献
18.
It is known that two interrelated problems called as line balancing and model sequencing should be solved simultaneously for an efficient implementation of a mixed-model U-shape assembly line in a JIT (Just in Time) environment. On the other hand, three versions of assembly line balancing problem can be identified: Type I, Type II, and Type E. There are only two articles ( Kara, Ozcan, & Peker, 2007a and Hamzadayi & Yildiz, 2012) related to simultaneous balancing and sequencing of mixed-model U-lines for minimizing the number of stations (Type 1 problem) by ignoring the fixed model sequence in the current literature. In this paper, a simulated annealing algorithm is proposed for solving a problem of type 1 by ignoring the fixed model sequence. Accordingly, simulated annealing based fitness evaluation approach proposed by Hamzadayi and Yildiz (2012) is enhanced by adding the tabu list, and inserted into the proposed algorithm. Implementation difficulties experienced in meta-heuristics based on solution modification for solving these types of problems are demonstrated. ‘Absolute deviation of workloads’ (ADW) is quite frequently used as performance criteria in the literature. It is found that ADW is an insufficient performance criterion for evaluating the performance of the solutions, and this is showed by means of an illustrative example. The parameters of the proposed algorithm are reviewed for calibrating the algorithm by means of Taguchi design of experiments. Performance of the proposed approach is tested through a set of test problems. The results of computational experiments indicate that the proposed approach is an effective method in solving simultaneous line balancing/model sequencing problems for mixed-model U-lines for minimizing the number of stations. 相似文献
19.
Dashuang Li Chaoyong Zhang Xinyu Shao Wenwen Lin 《Journal of Intelligent Manufacturing》2016,27(4):725-739
Two-sided assembly line is often designed to produce large-sized high-volume products such as cars, trucks and engineering machinery. However, in real-life production process, besides the elementary constraints in the one-sided assembly line, additional constraints, such as zoning constraints, positional constraints and synchronous constraints, may occur in the two-sided assembly line. In this paper, mathematical formulation of balancing multi-objective two-sided assembly line with multiple constraints is established, and some practical objectives, including maximization of the line efficiency, minimization of the smoothness index and minimization of the total relevant costs per product unit (Tcost), have been considered. A novel multi-objective optimization algorithm based on improved teaching–learning-based optimization (ITLBO) algorithm is proposed to obtain the Pareto-optimal set. In the ITLBO algorithm, teacher and learner phases are modified for the discrete problem, and late acceptance hill-climbing is integrated into a novel self-learning phase. A novel merging method is proposed to construct a new population according to the ordering relation between the original and evolutionary population. The proposed algorithm is tested on the benchmark instances and a practical case. Experimental results, compared with the ones computed by other algorithm and in current literature, validate the effectiveness of the proposed algorithm. 相似文献
20.
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. 相似文献