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

DOI10.1007/BF01416240zbMATH Open0765.90053OpenAlexW1986673660MaRDI QIDQ4031375FDOQ4031375

Authors: Otto Rosenberg, Hans Ziegler 

Publication date: 1 April 1993

Published in: 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

Recommendations

• A Multiple-rule Heuristic for Assembly Line Balancing
• Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
• scientific article; zbMATH DE number 4059101
• An enumerative heuristic and reduction methods for the assembly line balancing problem

zbMATH Keywords

simulationNP-completenesstime complexityheuristic algorithmsworst-case boundcost-oriented assembly line balancingpositional-weight-methodpositional-weight-wage-rate-difference-methodwage-rate-methodwage-rate-smoothing-method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Assembly line balancing as generalized bin packing
• Title not available (Why is that?)

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031375)