Shortest-route formulation of mixed-model assembly line balancing problem
From MaRDI portal
Publication:1610143
DOI10.1016/S0377-2217(98)00115-5zbMath1009.90120OpenAlexW2067718231MaRDI QIDQ1610143
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00115-5
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (16)
U-shaped assembly line layouts and their impact on labor productivity: an experimental study ⋮ Balancing and sequencing of parallel mixed-model assembly lines ⋮ A classification of assembly line balancing problems ⋮ A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs ⋮ Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment ⋮ An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem ⋮ Mixed model line balancing with parallel stations, zoning constraints, and ergonomics ⋮ Multi-objective design of team oriented assembly systems. ⋮ A network model for parallel line balancing problem ⋮ On the complexity of assembly line balancing problems ⋮ A shortest route formulation of simple U-type assembly line balancing problem ⋮ Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem ⋮ A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations ⋮ Integrated planning for product module selection and assembly line design/reconfiguration ⋮ A survey on problems and methods in generalized assembly line balancing ⋮ A heuristic solution for fuzzy mixed-model line balancing problem
Cites Work
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Balancing Mixed Model Lines with In-Process Inventories
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- The mixed-model U-line balancing problem
- An Algorithm for the Line Balancing Problem
- Mixed Model Line Balancing with Smoothed Station Assignments
This page was built for publication: Shortest-route formulation of mixed-model assembly line balancing problem