• A branch and bound algorithm f...

Treffer: A branch and bound algorithm for disassembly scheduling with assembly product structure

Title:
A branch and bound algorithm for disassembly scheduling with assembly product structure
Authors:
KIRN, H-J, LEE, D-H, XIROUCHAKIS, P, KWON, O. K
Source:
The Journal of the Operational Research Society. 60(3):419-430
Publisher Information:
Basingstoke: Palgrave Macmillan, 2009.
Publication Year:
2009
Physical Description:
print, 3/4 p
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Ordonnancement, Scheduling, sequencing, Gestion des stocks, gestion de la production. Distribution, Inventory control, production control. Distribution, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Borne inférieure, Lower bound, Cota inferior, Borne supérieure, Upper bound, Cota superior, Démontage, Desassembly, Desmontaje, Gestion environnement, Environmental management, Gestiòn medio ambiente, Gestion production, Production management, Gestión producción, Montage, Assembly, Montaje, Multiplicateur Lagrange, Lagrange multiplier, Multiplicador Lagrange, Méthode heuristique, Heuristic method, Método heurístico, Méthode séparation et évaluation, Branch and bound method, Método branch and bound, Ordonnancement, Scheduling, Reglamento, Planification production, Production planning, Programación producción, Problème NP difficile, NP hard problem, Problema NP duro, Structure produit, Product structure, Estructura producto, Temps calcul, Computation time, Tiempo computación, Timing, environmental studies, optimal algorithm, production and scheduling
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Graduate School of Logistics, Inha University, Incheon, Korea, Republic of
Hanyang University, Seoul, Korea, Republic of
Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
ISSN:
0160-5682
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=21152119
Rights:
Copyright 2009 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.21152119
Database:
PASCAL Archive

Weitere Informationen

This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the demand of their parts or components over a planning horizon. The case of single product type without parts commonality is considered for the objective of minimizing the sum of setup and inventory holding costs. To show the complexity of the problem, we prove that the problem is NP-hard. Then, after deriving the properties of optimal solutions, a branch and bound algorithm is suggested that incorporates the Lagrangean relaxation-based upper and lower bounds. Computational experiments are performed on a number of randomly generated problems and the test results indicate that the branch and bound algorithm can give optimal solutions up to moderate-sized problems in a reasonable computation time. A Lagrangean heuristic for a viable alternative for large-sized problems is also suggested and compared with the existing heuristics to show its effectiveness.