Economic lot scheduling problem with consideration of money time value

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

The economic lot scheduling problem (ELSP) is a challenge between sequencing and lot sizing. In this problem, several products must be produced on a single machine in a cyclical production pattern and the primary goal is to minimize the total setup and holding expenditures. Since time affects the value of money, it is necessary to take into account the time value of money when gradual payment is the case. In this paper, a new ELSP model with the consideration of the time value of money is considered. The proposed model of this paper is formulated as a nonlinear mixed integer model and a hybrid GA is presented to solve the resulted model for large-scale problems. The proposed method is solved for some benchmark problems for large-scale problems. © 2010 Growing Science Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Mokhlesian, M., Ghomi, S. M. T. F., & Jolai, F. (2010). Economic lot scheduling problem with consideration of money time value. International Journal of Industrial Engineering Computations, 1(2), 121–138. https://doi.org/10.5267/j.ijiec.2010.02.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free