文章基本信息

标题：A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem
本地全文：下载
作者：Maryam Mohammadi ; Masine Md. Tap
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：2
出版社：IJCSI Press
摘要：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.
关键词：Lot;Sizing Problem; Mixed Integer Programming; Optimum Order Quantity; Purchasing Cost; Ordering Cost; Holding Cost.