An asynchronous parallel disassembly planning based on genetic algorithm
type: Item
instance of: scholarly article
title: An asynchronous parallel disassembly planning based on genetic algorithm
zbMATH Open document ID: 1388.90105
author: Yaping Ren
author: Chaoyong Zhang
author: Fu Zhao
author: Huajun Xiao
author: Guangdong Tian
published in: European Journal of Operational Research
publication date: 2018-05-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6870779
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: disassembly sequence planning
zbMATH Keywords: asynchronous parallel disassembly
zbMATH Keywords: operation time-dependent
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.01.055
OpenAlex ID: W2792123081
cites work: An efficient GRASP algorithm for disassembly sequence planning
cites work: Profit-oriented disassembly-line balancing
cites work: Application of genetic algorithms in production and operations management: a review
cites work: A hybrid genetic algorithm for the job shop scheduling problem
cites work: A scatter search approach to the optimum disassembly sequence problem
cites work: Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
cites work: The proportionate two-machine no-wait job shop scheduling problem
cites work: Methods for optimum and near optimum disassembly sequencing
cites work: Optimizing disassembly processes subjected to sequence-dependent cost
cites work: Disassembly sequencing: A survey
cites work: Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships
cites work: Assembly and disassembly: An overview and framework for cooperation requirement planning with conflict resolution
cites work: A multi-criteria decision making model for advanced repair-to-order and disassembly-to-order system
cites work: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
cites work: Disassembly sequence generation: A Petri net based heuristic approach
cites work: Assembly/disassembly task planning and simulation using expert Petri nets
cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
cites work: A very fast TS/SA algorithm for the job shop scheduling problem
DOI: 10.1016/J.EJOR.2018.01.055
description: scientific article; zbMATH DE number 6870779