Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
From MaRDI portal
Publication:5488400
zbMATH Open1167.90590MaRDI QIDQ5488400FDOQ5488400
Authors: Fernando J. Marval L., Manuel V. Centeno, Juan J. Salazar G. 
Publication date: 14 September 2006
Full work available at URL: https://eudml.org/doc/55852
Recommendations
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Improving the resolution of the simple assembly line balancing problem type E
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- An improved mathematical program to solve the simple assembly line balancing problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (9)
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Approximation algorithms for simple assembly line balancing problems
- An efficient heuristic method for the simple assembly line balancing problem
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Improving the resolution of the simple assembly line balancing problem type E
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- On the complexity of assembly line balancing problems
This page was built for publication: Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488400)
