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

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 pu...

Full description

Saved in:

Bibliographic Details
Main Authors:	Mohammadi, Maryam, Md. Tap, Masine
Format:	Article
Published:	IJCSI 2012
Subjects:	TJ Mechanical engineering and machinery
Online Access:	http://eprints.utm.my/id/eprint/30397/ http://ijcsi.org/articles/A-mixed-integer-programming-model-formulation-for-solving-the-lotsizing-problem.php
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Universiti Teknologi Malaysia

id	my.utm.30397
record_format	eprints
spelling	my.utm.303972019-07-23T09:01:25Z http://eprints.utm.my/id/eprint/30397/ A mixed integer programming model formulation for solving the lot-sizing problem Mohammadi, Maryam Md. Tap, Masine TJ Mechanical engineering and machinery 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. IJCSI 2012-03 Article PeerReviewed 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 http://ijcsi.org/articles/A-mixed-integer-programming-model-formulation-for-solving-the-lotsizing-problem.php
institution	Universiti Teknologi Malaysia
building	UTM Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Teknologi Malaysia
content_source	UTM Institutional Repository
url_provider	http://eprints.utm.my/
topic	TJ Mechanical engineering and machinery
spellingShingle	TJ Mechanical engineering and machinery Mohammadi, Maryam Md. Tap, Masine A mixed integer programming model formulation for solving the lot-sizing problem
description	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.
format	Article
author	Mohammadi, Maryam Md. Tap, Masine
author_facet	Mohammadi, Maryam Md. Tap, Masine
author_sort	Mohammadi, Maryam
title	A mixed integer programming model formulation for solving the lot-sizing problem
title_short	A mixed integer programming model formulation for solving the lot-sizing problem
title_full	A mixed integer programming model formulation for solving the lot-sizing problem
title_fullStr	A mixed integer programming model formulation for solving the lot-sizing problem
title_full_unstemmed	A mixed integer programming model formulation for solving the lot-sizing problem
title_sort	mixed integer programming model formulation for solving the lot-sizing problem
publisher	IJCSI
publishDate	2012
url	http://eprints.utm.my/id/eprint/30397/ http://ijcsi.org/articles/A-mixed-integer-programming-model-formulation-for-solving-the-lotsizing-problem.php
_version_	1643648543291867136

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

Similar Items