An exact procedure for cost-oriented assembly line balancing

MaRDI QIDQ4233367zbMATH OpenFDO

Authors Matthias Amen

Publication date 5 August 1999

zbMATH Keywords

cost-oriented assembly line balancingexact backtracking-approach

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Optimally balancing assembly lines with different workstations
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem

Cited in

(5)

• A memetic algorithm for the cost-oriented robotic assembly line balancing problem
• A classification of assembly line balancing problems
• A survey on problems and methods in generalized assembly line balancing
• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
• A working-forward method for cost oriented balancing of assemply lines

This page was built for publication: An exact procedure 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 Q4233367)