Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
DOI10.1016/J.EJOR.2021.12.002OpenAlexW4200475156MaRDI QIDQ2140318FDOQ2140318
Authors: Enric Andreu-Casas, Alberto García-Villoria, Rafael Pastor 
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.12.002
Recommendations
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A survey on problems and methods in generalized assembly line balancing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- On practical resource allocation for production planning and scheduling with period overlapping setups
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
- A mathematical model and a genetic algorithm for two-sided assembly line balancing
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
Cited In (4)
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem
Uses Software
This page was built for publication: Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140318)
