Improving the resolution of the simple assembly line balancing problem type E
From MaRDI portal
Publication:3179375
zbMATH Open1352.90082MaRDI QIDQ3179375FDOQ3179375
Authors: Albert Corominas, Alberto García-Villoria, Rafael Pastor 
Publication date: 21 December 2016
Full work available at URL: http://www.idescat.cat/sort/sort402/40.2.1.corominas-etal.pdf
Recommendations
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- 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
- Balancing of simple assembly lines under variations of task processing times
Cited In (10)
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Approximation algorithms for simple assembly line balancing problems
- Iterative beam search for simple assembly line balancing with a fixed number of work stations
- Analysis of the simple assembly line balancing problem complexity
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types
- An improved mathematical program to solve the simple assembly line balancing problem
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- An alternative MILP model for makespan minimization on assembly lines
This page was built for publication: Improving the resolution of the simple assembly line balancing problem type E
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179375)
