Search results

This paper aims to propose a parallel automated assembly line system to produce multiple products in a semi-continuous system.

The control system developed in this research consists of a manufacturing system for two-level hierarchical dynamic decisions of autonomous/automated/automatic-guided vehicles (AGVs) dispatching/next station selection and machining schedules and a station control scheme for operational control of machines and components. In this proposed problem, the assignment of multiple AGVs to different assembly lines and the semi-continuous stations is a critical objective. AGVs and station scheduling decisions are made at the assembly line level. On the other hand, component and machining resource scheduling are made at the station level.

The proposed scheduler first decomposes the dynamic scheduling problems into a static AGV and machine assignment during each short-term rolling window. It optimizes weighted completion time of tasks for each short-term window by formulating the task and resource assignment problem as a minimum cost flow problem during each short-term scheduling window. A comprehensive decision making process and heuristics are developed for efficient implementation. A simulation study is worked out for validation.

Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The sequence of stations is pre-specified in each assembly line and the components of a product are kept in machine magazine. The transportation between the stations in an assembly line (intra assembly line) and among stations in different assembly lines (inter assembly line) are performed using AGVs.

Optimizing material handling within the factory is one of the key problems of modern assembly line systems. The purpose of this paper is to focus on simultaneously balancing a robotic assembly line and the scheduling of material handling required for the operation of such a system, a topic that has received limited attention in academia. Manufacturing industries focus on full autonomy because of the rapid advancements in different elements of Industry 4.0 such as the internet of things, big data and cloud computing. In smart assembly systems, this autonomy aims at the integration of automated material handling equipment such as automated guided vehicles (AGVs) to robotic assembly line systems to ensure a reliable and flexible production system.

This paper tackles the problem of designing a balanced robotic assembly line and the scheduling of AGVs to feed materials to these lines such that the cycle time and total tardiness of the assembly system are minimized. Because of the combination of two well-known complex problems such as line balancing and material handling and a heuristic- and metaheuristic-based integrated decision approach is proposed.

A detailed computational study demonstrates how an integrated decision approach can serve as an efficient managerial tool in designing/redesigning assembly line systems and support automated transportation infrastructure.

This study is beneficial for production managers in understanding the main decisional steps involved in the designing/redesigning of smart assembly systems and providing guidelines in decision-making. Moreover, this study explores the material distribution scheduling problems in assembly systems, which is not yet comprehensively explored in the literature.

Reducing production auxiliary time is the key to improve the efficiency of the existing mixed-flow assembly line. This paper proposes a method combining improved genetic algorithm (GA) and Flexsim software. It also investigates mixed-flow assembly line scheduling and just-in-time (JIT) parts feeding scheme to reduce waste in production while taking the existing hill-drop mixed-flow assembly line as an example to verify the effectiveness of the method.

In this research, a method is presented to optimize the efficiency of the present assembly line. The multi-objective mathematical model is established based on the objective function of the minimum production cycle and part consumption balance, and the solution model is developed using multi-objective GA to obtain the mixed flow scheduling scheme of the hill-drop planter. Furthermore, modeling and simulation with Flexsim software are investigated along with the contents of line inventory, parts transportation means, daily feeding times and time points.

Theoretical analysis and simulation experiments are carried out in this paper while taking an example of a hill-drop planter mixed-flow assembly line. The results indicate that the method can effectively reduce the idle and overload of the assembly line, use the transportation resources rationally and decrease the accumulation of the line inventory.

The method of combining improved GA and Flexsim software was used here for the first time intuitively and efficiently to study the balance of existing production lines and JIT feeding of parts. Investigating the production scheduling scheme provides a reference for the enterprise production line accompanied by the quantity allocation of transportation tools, the inventory consumption of the spare parts along the line and the utilization rate of each station to reduce the auxiliary time and apply practically.

In response to the station design and flexible resources allocation of the aircraft moving assembly line, a new problem named flexible resource investment problem based on project splitting (FRIP_PS), which minimizes total cost of resources with a given deadline are proposed in this paper.

First, a corresponding mathematical model considering project splitting is constructed, which needs to be simultaneously determined together with job scheduling to acquire the optimized project scheduling scheme and resource configurations. Then, an integrated nested optimization algorithm including project splitting policy and job scheduling policy is designed in this paper. In the first stage of the algorithm, a heuristic algorithm designed to get the project splitting scheme and then in the second stage a genetic algorithm with local prospective scheduling strategy is adopted to solve the flexible resource investment problem.

The heuristic algorithm of project splitting gets better project splitting results through the job shift selection strategy and meanwhile guides the algorithm of the second stage. Furthermore, the genetic algorithm solves resources allocation and job schedule through evaluation rules which can effectively solve the delayed execution of jobs because of improper allocation of flexible resources.

This paper represents a new extension of the resource investment problem based on aircraft moving assembly line. An effective integrated nested optimization algorithm is proposed to specify station splitting scheme, job scheduling scheme and resources allocation in the assembly lines, which is significant for practical engineering applications.

This paper aims to investigate the scheduling and loading problems of tow trains for mixed-model assembly lines (MMALs). An in-plant milk-run delivery model has been formulated to minimize total line-side inventory for all stations over the planning horizon by specifying the departure time, parts quantity of each delivery and the destination station.

An immune clonal selection algorithm (ICSA) combined with neighborhood search (NS) and simulated annealing (SA) operators, which is called the NSICSA algorithm, is developed, possessing the global search ability of ICSA, the ability of SA for escaping local optimum and the deep search ability of NS to get better solutions.

The modifications have overcome the deficiency of insufficient local search and deepened the search depth of the original metaheuristic. Meanwhile, good approximate solutions are obtained in small-, medium- and large-scale instances. Furthermore, inventory peaks are in control according to computational results, proving the effectiveness of the mathematical model.

This study works out only if there is no breakdown of tow trains. The current work contributes to the in-plant milk-run delivery scheduling for MMALs, and it can be modified to deal with similar part feeding problems.

The capacity limit of line-side inventory for workstations as well as no stock-outs rules are taken into account, and the scheduling and loading problems are solved satisfactorily for the part distribution of MMALs.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.

This study aims to reduce carbon emissions and costs in an automobile production plant by improving the operational management efficiency of a serial assembly line assisted by a feeding electric tow vehicle (ETV).

A multi-objective function is formulated to minimize the energy consumption of the ETV from which emissions and costs are measured. First, a mixed-integer linear programming model is used to solve the feeding problem for different sizes of the assembly line. Second, a bi-objective optimization (HBOO) model is used to simultaneously minimize the most eco-efficient objectives: the number of completed runs (tours) by the ETV along the assembly line, and the number of visits (stops) made by the ETV to deliver kits of components to workstations.

The most eco-efficient strategy is always the bi-objective optimal solution regardless of the size of the assembly line, whereas, for single objectives, the optimization strategy differs depending on the size of the assembly line.

Instances of the problem are randomly generated to reproduce real conditions of a particular automotive factory according to a previous case study. The optimization procedure allows managers to assess real scenarios improving the assembly line eco-efficiency. These results promote the implementation of automated control of feeding processes in green manufacturing.

The HBOO-model assesses the assembly line performance with a view to reducing the environmental impact effectively and contributes to reducing the existent gap in the literature. The optimization results define key strategies for manufacturing industries eager to integrate battery-operated motors or to address inefficient traffic of automated transport to curb the carbon footprint.

Line–cell conversion and rotation of operators between cells are common in lean production systems. Thus, the purpose of this study is to provide an integrated look at these two practices through integrating job rotation scheduling and line-cell conversion problems, as well as investigating the effect of rotation frequency on flow time of a Seru system.

First, a nonlinear integer programming model of job rotation scheduling problem and line–cell conversion problem (Seru-JRSP) was presented. Then, because Seru-JRSP is NP-hard, an efficient and effective invasive weed optimization (IWO) algorithm was developed. Exploration process of IWO was enhanced by enforcing two shake mechanisms.

Computations of various sample problems showed shorter flow time and less number of assigned operators in a Seru system scheduled through job rotation. Also, nonlinear behavior of flow time versus number of rotation periods was shown. It was demonstrated that, setting number of rotation frequency to one in line with the literature leads to inferior flow time. In addition, ability of developed algorithm to generate clusters of equivalent solutions in terms of flow time was shown.

In this research, integration of job rotation scheduling and line–cell conversion problems was introduced, considering lack of an integrated look at these two practices in the literature. In addition, a new improved IWO equipped with shake enforcement was introduced.

Facing the challenge of increasing energy cost and requirement of reducing the emissions, identifying the potential factors of them in the manufacturing factories is an important prerequisite to control energy consumption. This paper aims to present a bi-objective green in-house transportation scheduling and fleet size determination problem (BOGIHTS&FSDP) in automobile assembly line to schedule the material delivery tasks, which jointly take the energy consumption into consideration as well.

This research proposes an optimal method for material handling in automobile assembly line. To solve the problem, several properties and definitions are proposed to solve the model more efficiently. Because of the non-deterministic polynomial-time-hard nature of the proposed problem, a Multi-objective Discrete Differential Evolution Algorithm with Variable Neighborhood Search (VNS-MDDE) is developed to solve the multi-objective problem.

The performances of VNS-MDDE are evaluated in simulation and the results indicate that the proposed algorithm is effective and efficient in solving BOGIHTS&FSDP problem.

This study is the first to take advantage of the robot's interactive functions for part supply in automobile assembly lines, which is both the challenge and trend of future intelligent logistics under the pressure of energy and resource. To solve the problem, a VNS-MDDE is developed to solve the multi-objective problem.

Walking-worker assembly lines can be regarded as an effective method to achieve the above-mentioned characteristics. In such systems, workers, following each other, travel workstations in sequence by performing all of the required tasks of their own product. As the eventual stage of assembly line design, efforts should be made for capacity adjustments to meet the demand in terms of allocating tasks to workers via assembly line balancing. In this context, the purpose of this study is to address the balancing problem for multi-model walking-worker assembly systems, with the aim of improving planning capability for such systems by means of developing an optimization methodology.

Two linear integer programming models are proposed to balance a multi-model walking-worker assembly line optimally in a sequential manner. The first mathematical programming model attempts to determine number of workers in each segment (i.e. rabbit chase loop) for each model. The second model generates stations in each segment to smooth workflow. What is more, heuristic algorithms are provided due to computational burden of mathematical programming models. Two segment generation heuristic algorithms and a station generation heuristic algorithm are provided for the addressed problem.

The application of the mathematical programming approach improved the performance of a tap-off box assembly line in terms of number of workers (9.1 per cent) and non-value-added time ratio (between 27.9 and 26.1 per cent for different models) when compared to a classical assembly system design. In addition, the proposed approach (i.e. segmented walking-worker assembly line) provided a more convenient working environment (28.1 and 40.8 per cent shorter walking distance for different models) in contrast with the overall walking-worker assembly line. Meanwhile, segment generation heuristics yielded reduction in labour requirement for a considerable number (43.7 and 49.1 per cent) of test problems. Finally, gaps between the objective values and the lower bounds have been observed as 8.3 per cent (Segment Generation Heuristic 1) and 6.1 (Segment Generation Heuristic 2).

The proposed study presents a decision support for walking-worker line balancing with high level of solution quality and computational performance for even large-sized assembly systems. That being the case, it contributes to the management of real-life assembly systems in terms of labour planning and ergonomics. Owing to the fact that the methodology has the potential of reducing labour requirement, it will present the opportunity of utilizing freed-up capacity for new lines in the start-up period or other bottleneck processes. In addition, this study offers a working environment where skill of the workers can be improved within reasonable walking distances.

To the best knowledge of the author, workload balancing on multi-model walking-worker assembly lines with rabbit chase loop(s) has not yet been handled. Addressing this research gap, this paper presents a methodology including mathematical programming models and heuristic algorithms to solve the multi-model walking-worker assembly line balancing problem for the first time.