A comparison of heuristic algorithms for cost-oriented assembly line balancing

DOI10.1007/BF01416240zbMath0765.90053OpenAlexW1986673660MaRDI QIDQ4031375

Hans Ziegler, Otto Rosenberg

Publication date: 1 April 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01416240

zbMATH Keywords

simulationNP-completenessheuristic algorithmstime complexityworst-case boundcost-oriented assembly line balancingpositional-weight-methodpositional-weight-wage-rate-difference-methodwage-rate-methodwage-rate-smoothing-method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

A classification of assembly line balancing problems ⋮ A versatile algorithm for assembly line balancing ⋮ A decomposition method for transfer line life cycle cost optimisation ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach ⋮ Using distributed search methods for balancing mixed-model assembly lines in the automotive industry ⋮ A survey on problems and methods in generalized assembly line balancing ⋮ Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds ⋮ Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing

Cites Work

• Assembly line balancing as generalized bin packing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of heuristic algorithms for cost-oriented assembly line balancing