Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times

DOI10.1016/j.cor.2023.106285OpenAlexW4377141892MaRDI QIDQ6106588

Rafael Pastor, Alberto García-Villoria, Harry Aguilar

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106285

zbMATH Keywords

heuristicssimulated annealingbuffer sizingparallel assembly lines balancing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimization by Simulated Annealing
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• Introducing dynamic diversity into a discrete particle swarm optimization
• Balancing \(U\)-lines in a multiple \(U\)-line facility
• Assembly line balancing: what happened in the last fifteen years?
• An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
• A classification of assembly line balancing problems
• A survey on problems and methods in generalized assembly line balancing
• A survey of the parallel assembly lines balancing problem
• Balancing and sequencing of parallel mixed-model assembly lines
• U-shaped assembly line balancing problem with genetic algorithm
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• The U-line Line Balancing Problem
• Equation of State Calculations by Fast Computing Machines
• A Simplex Method for Function Minimization
• Balancing Just-In-Time Production Units: TheNU-Line Balancing Problem
• Handbook of metaheuristics

This page was built for publication: Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times