A Heuristic Master Planning Algorithm for Supply Chain Network:The Impact on Decision Making with Setup Cost and Time
Date Issued
2005
Date
2005
Author(s)
Fu, Allen
DOI
zh-TW
Abstract
Under a more and more competitive business environment, maximizing the profit, cutting down the cost, and reducing lead time should be the first prioritized goals and can be achieved by the integrated planning of an overall supply chain. In the supply chain management, “Master Planning” is the way to coordinate several organizations and facilities to achieve the efficiency and effectiveness of the overall supply chain.
“Linear Programming” is usually used for solving problems related to “Master Planning”. Moreover, for master planning with fixed setup cost and time consideration, “Mixed Integer Programming” is adapted to solve such a problem. However, the complexity and computer solving time are much larger than a problem formulated as a “Linear Programming” model. Too many variables and constraints lead the problem to be unsolvable.
For the infeasibility or unsolvability of the “Mixed Integer Programming” formulations, this study develops a heuristic algorithm to solve “Mater Planning” problem with fixed setup cost and time. Multiple final products structure, multiple discrete periods, multiple orders, complexed supply chain networks, and fixed setup cost and time are considered to determine a production and distribution plan of all orders on each node of the supply chain network.
With fixed setup cost and time consideration, this study focuses on three main steps including order sorting algorithm, planning algorithm, and tuning algorithm. And the study proposes SVCB (Setup-Variable Cost Balance Algorithm) and SVCS (Setup-Variable Cost Sequence Algorithm) to solve two different multiple-objectives models. These algorithms are similar and composed of four steps: (1) Transform supply chain network structure into single-function based supply chain network structure. (2) Search relative organizations and paths to each final product. (3) Determine the planning sequence of orders. (4) Plan orders sequentially until each order is finished.
This study designs 24 scenarios by four dimensions. Due to complexity of these scenarios,”Mixed Integer Programming” formulations of these scenarios are unsolvable. Therefore, the algorithm without fixed cost and time consideration is adapted to be the benchmark. In the most of scenarios, the algorithms of this study can attain better solutions in a short solving time.
Subjects
供應鏈管理
主規劃排程
啟發式演算法
先進規劃排程
多目標最佳化
整備成本
整備時間
Supply Chain Management
Master Planning
Heuristic Algorithm
Advanced Planning and Scheduling
Multiple-goal Optimization
Setup Cost
Setup Time
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92725033-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):5afd49a084a5422d2793da0b4a5ef0f3