405 0

A hybrid heuristic approach for production planning in supply chain networks

Title
A hybrid heuristic approach for production planning in supply chain networks
Author
김대철
Keywords
Supply chain planning; Multi-level multi-item; Capacitated lot sizing; Back order; Hybrid heuristic; Meta-heuristics
Issue Date
2015-04
Publisher
SPRINGER LONDON LTD
Citation
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, v. 78, NO 1-4, Page. 395-406
Abstract
Planning distributed manufacturing facilities is one of the most challenging tasks in the supply chain management. This paper proposes a production planning algorithm for the multi-level, multi-item capacitated lot-sizing problem (MLCLSP) in a supply chain network that takes back order into account. MLCLSP is a mixed integer linear programming (MIP) problem and is NP-hard. This paper presents an efficient, hybrid, heuristic algorithm named greedy rolling horizon search (GRHS) that combines a rolling horizon local search heuristic with an exact linear program (LP) solver. Computational experiments show that GRHS performs well in terms of total costs and computational time and is superior to existing meta-heuristics, such as tabu search, simulated annealing, and genetic algorithms.
URI
http://link.springer.com/article/10.1007%2Fs00170-014-6599-4http://hdl.handle.net/20.500.11754/23770
ISSN
0268-3768; 1433-3015
DOI
10.1007/s00170-014-6599-4
Appears in Collections:
GRADUATE SCHOOL OF BUSINESS[S](경영전문대학원) > BUSINESS ADMINISTRATION(경영학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE