Assembly line balancing and group working: A heuristic procedure for workers’ groups operating on the same product and workstation

In this paper, we examine an assembly line balancing problem that differs from the conventional one in the sense that there are multi-manned workstations, where workers’ groups simultaneously perform different assembly works on the same product and workstation. This situation requires that the product is of sufficient size, as for example in the automotive industry, so that the workers do not block each other during the assembly work. The proposed approach here results in shorter physical line length and production space utilization improvement, because the same number of workers can be allocated to fewer workstations. Moreover, the total effectiveness of the assembly line, in terms of idle time and production output rate, remains the same. A heuristic assembly line balancing procedure is thus developed and illustrated. Finally, experimental results of a real-life automobile assembly plant case and well-known problems from the literature indicate the effectiveness and applicability of the proposed approach in practice.     

Multi-criteria design of an control chart

Control chart designs are widely studied because control charts are not only costly used but also play an important role in improving firms' quality and productivity. Design of control charts refers to the selection of parameters, including sample size, control-limit width, and sampling frequency. In this paper, a possible combination of design parameters is considered as a decision-making unit; it is characterized by three attributes: hourly expected cost, average run length of process being controlled, and detection power of the chart designed with the selected parameters. Accordingly, optimal design of control charts can be formulated as a multiple criteria decision-making (MCDM) problem. To solve the MCDM problem, a solution procedure on the basis of data envelopment analysis is proposed. Finally, an industrial application is presented to illustrate the solution procedure. Also, adjustment to control chart design parameters is suggested when there are process improvements or process deteriorations.     

An integrated eigenvector–DEA–TOPSIS methodology for portfolio risk evaluation in the FOREX spot market

The foreign exchange market (FOREX) is the largest financial market in the world, with a volume of over $2 trillion daily. Decision making about buying and selling the existing products in this market depends on several effective factors which cause the high risk in it and make it a sensitive job. So in this paper a new method which is extracted from the multiple decision making methods named eigenvector–DEA–TOPSIS methodology is presented to evaluate the risk of the number of related portfolios to this market. The eigenvector technique is used to determine the weights of criteria and some linguistic terms are applied for assessing portfolio risks under each criterion, then in order to determine the value of linguistic terms we use the data envelopment analysis (DEA) method. Finally we use TOPSIS method for aggregating portfolio risks under different criteria into an overall risk score for each portfolio and ranking the portfolios according to their risks. The integrated eigenvector–DEA–TOPSIS methodology is applicable to any number of decision alternatives and is illustrated with a numerical example.     

Integrated model of operations effectiveness of small to medium-sized manufacturing enterprises

The Small to Medium-sized Manufacturing Enterprise (SME) has consistently demonstrated the ability to innovate and bring to the market new technologies and advancement in manufacturing. SMEs in industrialized nations function as the supplier base for domestic manufacturing. However, as more businesses are going global, SMEs face a new challenge in competing in the competitive global market. In this research, we aim to answer the following question: by taking advantage of the challenge as new opportunities, how SMEs can reposition themselves to be more competitive in the global market. We analyze the data collected from over 3000 SMEs using an integrated productivity-oriented model. The results present us with information about SMEs’ operation and performance. We are able to link both qualitative and quantitative factors of multiple manufacturing input/output to further assess the performance of SMEs, making a set of efficiency benchmarks available. This information can be used to help SMEs better understand the problems and opportunities confronting their operations. So their business transformations can be cost-effectively conducted for more competitive edges.     

On solving the assembly line worker assignment and balancing problem via beam search

Certain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is known as the assembly line worker assignment and balancing problem (ALWABP). This problem appears in settings where tasks must be assigned to workers, and workers to work stations. Task processing times are worker specific, and workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled.     

A new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems

This paper presents a new hybrid improvement heuristic approach to simple straight and U-type assembly line balancing problems which is based on the idea of adaptive learning approach and simulated annealing. The proposed approach uses a weight parameter to perturb task priorities of a solution to obtain improved solutions. The weight parameters are then modified using a learning strategy. The maximization of line efficiency (i.e., the minimization of the number of stations) and the equalization of workloads among stations (i.e., the minimization of the smoothness index or the minimization of the variation of workloads) are considered as the performance criteria. In order to clarify the proposed solution methodology, a well known problem taken from literature is solved. A computational study is conducted by solving a large number of benchmark problems available in the literature to compare the performance of the proposed approach to the existing methods such as simulated annealing and genetic algorithms. Some test instances taken from literature are also solved by the proposed approach. The results of the computational study show that the proposed approach performs quite effectively. It also yields optimal solutions for all test problems within a short computational time.     

Ranking alternatives in a preferential voting system using fuzzy concepts and data envelopment analysis

In this paper, a new method for aggregating the opinions of experts in a preferential voting system is proposed. The method, which uses fuzzy concept in handling crisp data, is computationally efficient and is able to completely rank the alternatives. Through this method, the number of votes for certain rank position that each alternative receives are first grouped together to form fuzzy numbers. The nearest point to a fuzzy number concept is then used to introduce an artificial ideal alternative. Data envelopment analysis is next used to find the efficiency scores of the alternatives in a pair-wise comparison with the artificial ideal alternative. Alternatives are rank based on these efficiency scores. If the alternatives are not completely ranked, a weight restriction method also based on fuzzy concept is used on the un-discriminated alternatives until they are completely ranked. Two examples are given for illustration of the method.     

Firing sequences backward algorithm for simple assembly line balancing problem of type 1

The objective of simple assembly line balancing problem type-1 (SALBP-1) is to minimize the number of workstations on an assembly line for a given cycle time. Since SALBP-1 is NP-hard, many iterative backtracking heuristics based on branch and bound procedure, tabu search, and genetic algorithms were developed to solve SALBP-1. In this study, a new heuristic algorithm based on Petri net approach is presented to solve the problem. The presented algorithm makes an order of firing sequence of transitions from Petri net model of precedence diagram. Task is assigned to a workstation using this order and backward procedure. The algorithm is coded in MATLAB, and its efficiency is tested on Talbot’s and Hoffmann’s benchmark datasets according to some performance measures and classifications. Computational study validates its effectiveness on the benchmark problems. Also comparison results show that the algorithm is efficiency to solve SALBP-1.     

Two-sided assembly line balancing problem of type I: Improvements,a simple algorithm and a comprehensive study

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.     

遗传算法在服装生产流水线平衡问题中的应用

将遗传算法应用于服装生产调度中，利用遗传算法的全局优化特点解决并行制造中的流水线平衡问题。并针对男式衬衫的生产工艺进行仿真，结果表明了该算法的有效性。