Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
From MaRDI portal
Publication:3032068
DOI10.1287/OPRE.37.6.916zbMATH Open0689.90047OpenAlexW1970485081MaRDI QIDQ3032068FDOQ3032068
Authors: T. S. Wee, Steven T. Hackman, Michael Magazine
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.6.916
Recommendations
- Balancing assembly lines effectively -- a computational comparison
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- A Multiple-rule Heuristic for Assembly Line Balancing
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Cited In (41)
- A hybrid neural approach to combinatorial optimization
- An linear programming based lower bound for the simple assembly line balancing problem
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Heuristic and metaheuristic procedures for the parallel assembly lines balancing problem with multi-line workstations and buffer sizing
- Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management.
- The sequence-dependent assembly line balancing problem
- Models for concurrent product and process design
- A versatile algorithm for assembly line balancing
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Bounds for Assembly Line Balancing Heuristics
- An efficient heuristic method for the simple assembly line balancing problem
- U-shaped assembly line balancing problem with genetic algorithm
- The mixed and multi model line balancing problem: A comparison
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Balancing assembly lines: an industrial case study
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines
- Ant algorithms for a time and space constrained assembly line balancing problem
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An improved mathematical program to solve the simple assembly line balancing problem
- A dynamic programming based heuristic for the assembly line balancing problem
- Assembly line balancing with buffers by multiple criteria optimization
- A heuristic solution for fuzzy mixed-model line balancing problem
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Expected Behaviour of Line-Balancing Heuristics
- A comparison of heuristic algorithms for cost-oriented assembly line balancing
- Balancing assembly lines effectively -- a computational comparison
- Balancing \(U\)-lines in a multiple \(U\)-line facility
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Assembly system design principles and tradeoffs
- Designing paced assembly lines with fixed number of stations
- Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem
This page was built for publication: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032068)