Shortest-route formulation of mixed-model assembly line balancing problem

DOI10.1016/S0377-2217(98)00115-5zbMath1009.90120MaRDI QIDQ1610143

Erdal Erel, Hadi Gökçen

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

zbMATH Keywords

network programming; assignment; assembly line balancing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

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, An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem, Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment, A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs, A network model for parallel line balancing problem, Multi-objective design of team oriented assembly systems., Mixed model line balancing with parallel stations, zoning constraints, and ergonomics, U-shaped assembly line layouts and their impact on labor productivity: an experimental study, On the complexity of assembly line balancing problems, A classification of assembly line balancing problems, A shortest route formulation of simple U-type assembly line balancing problem, A survey on problems and methods in generalized assembly line balancing, A heuristic solution for fuzzy mixed-model line balancing problem, Balancing and sequencing of parallel mixed-model assembly lines, Evaluation of performance measures for representing operational objectives of a mixed model assembly 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