An iterative decomposition for asynchronous mixed-model assembly lines: combining balancing, sequencing, and buffer allocation

Lopes, Thiago Cantos; Sikora, Celso Gustavo Stall; Michels, Adalberto Sato; Magatão, Leandro

doi:10.1080/00207543.2019.1598597

Cited by 26 publications

(4 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Defersha et al [60] proposed a hybrid genetic algorithm to solve the balancing and sorting problem and the workstation planning problem. Lopes et al [61] combined the buffer allocation problem and the balancing and sorting problem for co-optimization, proposed a combinatorial cooperative optimization model for such problems, and proposed an iterative decomposition framework to solve such cooperative optimization problems. Yang et al [62] proposed a formula to measure order similarity, which further improved the picking efficiency.…”

Section: Cooperative Optimization Of Batch and Sorting Of Order Sorti...mentioning

confidence: 99%

The Collaborative Optimization of Order Batching and Sequencing for Online Supermarkets with Parallel Picking Strategy Consumption

Ni¹

2023

FBEM

View full text Add to dashboard Cite

In the face of the diversity and complexity of online orders, online supermarkets need to improve their sorting efficiency to meet increasing customer demands. Order batching and parallel picking are two key measures to improve the efficiency of order picking, which have been widely applied in practice. Order batching involves combining multiple orders into one batch for picking, inspection, and packaging. Parallel picking involves picking items simultaneously in multiple picking areas. This research investigates the collaborative optimization problem of batching and sequencing online supermarket orders under the parallel picking strategy, aiming to reduce the waiting time between processes and improve the overall sorting efficiency. The research provides an effective scientific method for large-scale online supermarket order picking problems, which can enhance customer satisfaction through the improvement of service efficiency and further strengthen the competitiveness of online supermarkets.

show abstract

Section: Cooperative Optimization Of Batch and Sorting Of Order Sorti...mentioning

confidence: 99%

The Collaborative Optimization of Order Batching and Sequencing for Online Supermarkets with Parallel Picking Strategy Consumption

Ni¹

2023

FBEM

View full text Add to dashboard Cite

show abstract

“…It is worth mentioning that BAP is part of a larger manufacturing problem, dealing with the selection of optimal configurations for manufacturing systems. Hence, works in this field include also extended optimization problems with respect to decision variables and objective function, such as joint selection of machine and buffers with productivity performance [22], energy-efficient performance [23], transfer line [24,25] and assembly line [26] balancing, CONWIP policies [27], and time buffers [28] for cost optimization. Since the proposed work deals with BAP in serial lines, a set of relevant works is classified in Table 1.…”

Section: Minimization Of the Average Work-in-process Inventorymentioning

confidence: 99%

A novel algorithm for optimal buffer allocation in automated asynchronous unreliable lines

Magnanini

Terkaj²,

Tolio

2022

Int J Adv Manuf Technol

View full text Add to dashboard Cite

The Buffer Allocation Problem is a well-known optimization problem aiming at determining the optimal buffer sizes in a manufacturing system composed by various machines decoupled by buffers. This problem still has scientific relevance because of problem complexity and trade-off between conflicting goals. Moreover, it assumes industrial relevance in reconfigurable manufacturing lines, where buffer sizes can be easily adapted to the production scenario. This work proposes a novel algorithm integrating performance evaluation and optimization by means of throughput cuts based on a linear approximation. Numerical results show the validity of the proposed approach with respect to the traditional gradient-based method. Moreover, an industrial case study integrating the proposed approach into a decision-support system for the buffer allocation and reallocation is analyzed.

show abstract

“…In this paper, two optimization objectives are considered, including minimizing the total cost and time, as shown in equations (13) and (14). Equation (13) shows that the variation of parts usage rates, variation of workstation workload, and car model switching will be converted into the objective of minimizing the cost through the penalty cost unit and weighted coefficients, where ε and τ are penalty cost unit of the variation of parts usage rates M and workstation workload W respectively; α, φ, and γ are the weighted cost coefficients. Equation 14denotes minimizing the sum of idle time and overload time.…”

Section: Idle Time and Overload Timementioning

confidence: 99%

“…Ant colony optimization (ACO) algorithm was adopted to minimize the number of violating sequencing rules and the level of changeover complexity. Reference [13] presented an integrated model to describe the asynchronous mixed-model assembly line combining balancing, sequencing, and buffer allocation. Reference [14] investigated the multi-criteria model sequencing problem, considering three factors: flow time, total duration, and idle time.…”

Section: Introductionmentioning

confidence: 99%

A Multi-Objective Cuckoo Search Algorithm Based on the Record Matrix for a Mixed-Model Assembly Line Car-Sequencing Problem

Wang

Sheng

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In the car-sequencing problem of mixed-model assembly lines, a series of cars with different model types will be put into the assembly line in a certain order considering a variety of goals and constraints. In this paper, a multi-objective cuckoo search algorithm based on the record matrix is proposed to solve this problem. In this algorithm, the factors, including the variation of parts usage rates, variation of workstation workload, idle time, overload time, and model switching cost are considered. The record matrix proposed in this paper is utilized to record the characteristic information of the optimal solutions and historical solutions. Meanwhile, two search strategies based on the record matrix are proposed to enhance the ability of local search and global search in the algorithm. The proposed algorithm is verified by a real case. The results show that the proposed model and algorithm have good results, and they have the potential to address other similar problems. INDEX TERMS Car-sequencing problem, mixed-model assembly line, multi-objective cuckoo search algorithm, record matrix.

show abstract

An iterative decomposition for asynchronous mixed-model assembly lines: combining balancing, sequencing, and buffer allocation

Cited by 26 publications

References 47 publications

The Collaborative Optimization of Order Batching and Sequencing for Online Supermarkets with Parallel Picking Strategy Consumption

The Collaborative Optimization of Order Batching and Sequencing for Online Supermarkets with Parallel Picking Strategy Consumption

A novel algorithm for optimal buffer allocation in automated asynchronous unreliable lines

A Multi-Objective Cuckoo Search Algorithm Based on the Record Matrix for a Mixed-Model Assembly Line Car-Sequencing Problem

Contact Info

Product

Resources

About