An improved mathematical program to solve the simple assembly line balancing problem
From MaRDI portal
Recommendations
- An efficient heuristic method for the simple assembly line balancing problem
- Improved integer programming models for simple assembly line balancing and related problems
- An linear programming based lower bound for the simple assembly line balancing problem
- Improving the resolution of the simple assembly line balancing problem type E
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- On Assembly-Line Balancing Problems
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A versatile algorithm for assembly line balancing
- Analysis of the simple assembly line balancing problem complexity
Cites work
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Assembly-Line Balancing by Linear Programming
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- Eureka: A Hybrid System for Assembly Line Balancing
- Integer-programming software systems
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Solving Real-World Linear Programs: A Decade and More of Progress
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
Cited in
(16)- Reduction approaches for a generalized line balancing problem
- Assembly line balancing: what happened in the last fifteen years?
- An linear programming based lower bound for the simple assembly line balancing problem
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- New formulations for the setup assembly line balancing and scheduling problem
- Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm
- Improving the resolution of the simple assembly line balancing problem type E
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
- The ASALB Problem with Processing Alternatives Involving Different Tasks: Definition, Formalization and Resolution
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
- An alternative MILP model for makespan minimization on assembly lines
- Improved integer programming models for simple assembly line balancing and related problems
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types
- An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
This page was built for publication: An improved mathematical program to solve the simple assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055448)