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

DOI10.1007/BF01416240MaRDI QIDQ4031375zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cost-oriented assembly line balancingheuristic algorithmsNP-completenesspositional-weight-methodpositional-weight-wage-rate-difference-methodsimulationtime complexitywage-rate-methodwage-rate-smoothing-methodworst-case bound

Mathematics Subject Classification ID

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

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

Cites work

• Assembly line balancing as generalized bin packing
• scientific article; zbMATH DE number 3466787 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

Cited in

(10)

• A classification of assembly line balancing problems
• A versatile algorithm for assembly line balancing
• 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
• scientific article; zbMATH DE number 1487905 (Why is no real title available?)
• Analysis of the simple assembly line balancing problem complexity
• Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
• A decomposition method for transfer line life cycle cost optimisation
• Using distributed search methods for balancing mixed-model assembly lines in the automotive industry

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)