Abstract
This paper addresses a mixed integer programming (MIP)
formulation for the multi-item uncapacitated lot-sizing
problem that is inspired from the trailer manufacturer. The
proposed MIP model has been utilized to find out the
optimum order quantity, optimum order time, and the
minimum total cost of purchasing, ordering, and holding over
the predefined planning horizon. This problem is known as
NP-hard problem. The model was presented in an optimal
software form using LINGO 13.0.
formulation for the multi-item uncapacitated lot-sizing
problem that is inspired from the trailer manufacturer. The
proposed MIP model has been utilized to find out the
optimum order quantity, optimum order time, and the
minimum total cost of purchasing, ordering, and holding over
the predefined planning horizon. This problem is known as
NP-hard problem. The model was presented in an optimal
software form using LINGO 13.0.
| Original language | English |
|---|---|
| Pages (from-to) | 28-36 |
| Number of pages | 9 |
| Journal | International Journal of Computer Science Issues |
| Volume | 9 |
| Issue number | 2 |
| Publication status | Published - 2012 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- Lot-Sizing Problem
- Mixed Integer Programming
- Optimum Order Quantity
- Purchasing Cost
- Ordering Cost
- Holding Cost