A disassembly line balancing problem with fixed number of workstations

DOI10.1016/J.EJOR.2015.09.004zbMATH Open1346.90614OpenAlexW2102143815MaRDI QIDQ321005FDOQ321005

Sencer Yeralan, Meral Azizoğlu, Eda Göksoy Kalaycılar

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.004

zbMATH Keywords

heuristicsinteger programmingdisassembly lineslinear programming relaxation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Production models (90B30)

Cites Work

• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
• A sample average approximation method for disassembly line balancing problem under uncertainty
• Disassembly sequencing: A survey
• Disassembly line in product recovery
• Profit-oriented disassembly-line balancing
• A balancing method and genetic algorithm for disassembly line balancing
• Optimal disassembly of complex products
• Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem

Cited In (15)

• An exact solution method for multi-manned disassembly line design with and/or precedence relations
• A green-oriented bi-objective disassembly line balancing problem with stochastic task processing times
• A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
• Capacitated disassembly scheduling under stochastic yield and demand
• Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach
• Constraint programming for multi-line parallel partial disassembly line balancing problem with optional common stations
• A dynamic programming approach to a multi-objective disassembly line balancing problem
• Towards circular economy in production planning: challenges and opportunities
• Balancing of two-sided disassembly lines: problem definition, MILP model and genetic algorithm approach
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows
• Mixed integer programming approaches to partial disassembly line balancing and sequencing problem
• A novel constraint programming and simulated annealing for disassembly line balancing problem with and/or precedence and sequence dependent setup times
• Sustainable operations
• Disassembly line optimization with reinforcement learning
• A branch, bound, and remember algorithm for the simple disassembly line balancing problem

This page was built for publication: A disassembly line balancing problem with fixed number of workstations

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