Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
DOI10.1016/J.COR.2014.03.009zbMATH Open1348.90221OpenAlexW2078764258MaRDI QIDQ337057FDOQ337057
Albert Corominas, Gema Calleja, Rafael Pastor, Alberto GarcΓa-Villoria
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.009
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Production models (90B30)
Cites Work
- \texttt{Absalom}: balancing assembly lines with assignment restrictions
- A classification of assembly line balancing problems
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Matheuristics
- Stability measure for a generalized assembly line balancing problem
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- Reduction approaches for a generalized line balancing problem
- Workload Balancing in Multi-stage Production Processes
- Moving policies in cyclic assembly line scheduling
- Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
Cited In (6)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost
- Assembly line balancing: what happened in the last fifteen years?
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
- A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
Recommendations
- A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) π π
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) π π
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints π π
- Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1) π π
- On the MILP model for the U-shaped assembly line balancing problems π π
- An linear programming based lower bound for the simple assembly line balancing problem π π
- Branch-and-bound algorithms for the multi-product assembly line balancing problem π π
- A method for mixed-model assembly line balancing problem π π
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm π π
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds π π
This page was built for publication: Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337057)