Universiti Teknologi Malaysia Institutional Repository

A mixed integer programming model formulation for solving the lot-sizing problem

Mohammadi, Maryam and Md. Tap, Masine (2012) A mixed integer programming model formulation for solving the lot-sizing problem. Internation Journal of Computer Science Issues, 9 (2(1)). pp. 1694-1703. ISSN 1694-0784

Full text not available from this repository.

Official URL: http://ijcsi.org/articles/A-mixed-integer-programm...

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.

Item Type:Article
Uncontrolled Keywords:lot-sizing problem, mixed integer programming, optimum order quantity, purchasing cost, ordering cost, holding cost
Subjects:T Technology > TJ Mechanical engineering and machinery
Divisions:Mechanical Engineering
ID Code:30397
Deposited By: Yanti Mohd Shah
Deposited On:21 Apr 2013 03:28
Last Modified:23 Jul 2019 09:01

Repository Staff Only: item control page