A heuristic for disassembly planning in remanufacturing system

Jinmo Sung, Bongju Jeong

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This study aims to improve the efficiency of disassembly planning in remanufacturing environment. Even though disassembly processes are considered as the reverse of the corresponding assembly processes, under some technological and management constraints the feasible and efficient disassembly planning can be achieved by only well-designed algorithms. In this paper, we propose a heuristic for disassembly planning with the existence of disassembled part/subassembly demands. A mathematical model is formulated for solving this problem to determine the sequence and quantity of disassembly operations to minimize the disassembly costs under sequence-dependent setup and capacity constraints. The disassembly costs consist of the setup cost, part inventory holding cost, disassembly processing cost, and purchasing cost that resulted from unsatisfied demand. A simple but efficient heuristic algorithm is proposed to improve the quality of solution and computational efficiency. The main idea of heuristic is to divide the planning horizon into the smaller planning windows and improve the computational efficiency without much loss of solution quality. Performances of the heuristic are investigated through the computational experiments.

Original languageEnglish
Article number949527
JournalScientific World Journal
Volume2014
DOIs
Publication statusPublished - 2014

Fingerprint

heuristics
Costs and Cost Analysis
Planning
cost
Costs
Computational efficiency
Efficiency
Purchasing
Heuristic algorithms
planning
Heuristics
Theoretical Models
Mathematical models
Equipment and Supplies
Processing
experiment
Experiments

All Science Journal Classification (ASJC) codes

  • Biochemistry, Genetics and Molecular Biology(all)
  • Environmental Science(all)

Cite this

@article{5c3eebde70494848849b916d2126d664,
title = "A heuristic for disassembly planning in remanufacturing system",
abstract = "This study aims to improve the efficiency of disassembly planning in remanufacturing environment. Even though disassembly processes are considered as the reverse of the corresponding assembly processes, under some technological and management constraints the feasible and efficient disassembly planning can be achieved by only well-designed algorithms. In this paper, we propose a heuristic for disassembly planning with the existence of disassembled part/subassembly demands. A mathematical model is formulated for solving this problem to determine the sequence and quantity of disassembly operations to minimize the disassembly costs under sequence-dependent setup and capacity constraints. The disassembly costs consist of the setup cost, part inventory holding cost, disassembly processing cost, and purchasing cost that resulted from unsatisfied demand. A simple but efficient heuristic algorithm is proposed to improve the quality of solution and computational efficiency. The main idea of heuristic is to divide the planning horizon into the smaller planning windows and improve the computational efficiency without much loss of solution quality. Performances of the heuristic are investigated through the computational experiments.",
author = "Jinmo Sung and Bongju Jeong",
year = "2014",
doi = "10.1155/2014/949527",
language = "English",
volume = "2014",
journal = "The Scientific World Journal",
issn = "2356-6140",
publisher = "Hindawi Publishing Corporation",

}

A heuristic for disassembly planning in remanufacturing system. / Sung, Jinmo; Jeong, Bongju.

In: Scientific World Journal, Vol. 2014, 949527, 2014.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A heuristic for disassembly planning in remanufacturing system

AU - Sung, Jinmo

AU - Jeong, Bongju

PY - 2014

Y1 - 2014

N2 - This study aims to improve the efficiency of disassembly planning in remanufacturing environment. Even though disassembly processes are considered as the reverse of the corresponding assembly processes, under some technological and management constraints the feasible and efficient disassembly planning can be achieved by only well-designed algorithms. In this paper, we propose a heuristic for disassembly planning with the existence of disassembled part/subassembly demands. A mathematical model is formulated for solving this problem to determine the sequence and quantity of disassembly operations to minimize the disassembly costs under sequence-dependent setup and capacity constraints. The disassembly costs consist of the setup cost, part inventory holding cost, disassembly processing cost, and purchasing cost that resulted from unsatisfied demand. A simple but efficient heuristic algorithm is proposed to improve the quality of solution and computational efficiency. The main idea of heuristic is to divide the planning horizon into the smaller planning windows and improve the computational efficiency without much loss of solution quality. Performances of the heuristic are investigated through the computational experiments.

AB - This study aims to improve the efficiency of disassembly planning in remanufacturing environment. Even though disassembly processes are considered as the reverse of the corresponding assembly processes, under some technological and management constraints the feasible and efficient disassembly planning can be achieved by only well-designed algorithms. In this paper, we propose a heuristic for disassembly planning with the existence of disassembled part/subassembly demands. A mathematical model is formulated for solving this problem to determine the sequence and quantity of disassembly operations to minimize the disassembly costs under sequence-dependent setup and capacity constraints. The disassembly costs consist of the setup cost, part inventory holding cost, disassembly processing cost, and purchasing cost that resulted from unsatisfied demand. A simple but efficient heuristic algorithm is proposed to improve the quality of solution and computational efficiency. The main idea of heuristic is to divide the planning horizon into the smaller planning windows and improve the computational efficiency without much loss of solution quality. Performances of the heuristic are investigated through the computational experiments.

UR - http://www.scopus.com/inward/record.url?scp=84901255318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901255318&partnerID=8YFLogxK

U2 - 10.1155/2014/949527

DO - 10.1155/2014/949527

M3 - Article

AN - SCOPUS:84901255318

VL - 2014

JO - The Scientific World Journal

JF - The Scientific World Journal

SN - 2356-6140

M1 - 949527

ER -