Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
type: Item
instance of: scholarly article
title: Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
author: Büşra Yazıcı
author: Omer Faruk Yilmaz
published in: Annals of Operations Research
publication date: 2022-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7634707
zbMATH Keywords: multi-objective disassembly line balancing
zbMATH Keywords: multi-manned stations
zbMATH Keywords: AUGMECON2
zbMATH Keywords: NSGA-II
MaRDI profile type: Publication
full work available at URL: s10479-020-03902-3
OpenAlex ID: W3119570095
cites work: A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
cites work: Profit-oriented disassembly-line balancing
cites work: A sample average approximation method for disassembly line balancing problem under uncertainty
cites work: Bi-objective ant colony optimization approach to optimize production and maintenance scheduling
cites work: Multi-objective design of team oriented assembly systems.
cites work: Constraint programming model for multi-manned assembly line balancing problem
cites work: Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
cites work: Evolutionary many-objective optimization for mixed-model disassembly line balancing with multi-robotic workstations
cites work: Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
cites work: Disassembly line in product recovery
cites work: Finding representative systems for discrete bicriterion optimization problems
cites work: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
cites work: Type-E disassembly line balancing problem with multi-manned workstations
cites work: A branch, bound, and remember algorithm for the simple disassembly line balancing problem
cites work: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
cites work: A balancing method and genetic algorithm for disassembly line balancing
cites work: A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
cites work: An efficient hybrid artificial bee colony algorithm for disassembly line balancing problem with sequence-dependent part removal times
DOI: 10.1007/S10479-020-03902-3
describes a project that uses: GitHub
description: scientific article; zbMATH DE number 7634707