AN EFFICIENT DYNAMIC PROGRAMMING APPROACH TO OPTIMIZE CAPACITATED LOT-SIZING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HAJIPOUR VAHID; MOHAMMADIZADEH MOHAMMADREZA; ABBASI MORTEZA

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ADVANCES IN MATHEMATICAL MODELING Year:2016 | Volume:6 | Issue:1 Page(s): 89-102

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

2,338

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT DYNAMIC PROGRAMMING APPROACH TO OPTIMIZE CAPACITATED LOT-SIZING PROBLEM

Author(s)

HAJIPOUR VAHID | MOHAMMADIZADEH MOHAMMADREZA | ABBASI MORTEZA | Issue Writer Certificate

Keywords

MATHEMATICAL PROGRAMMINGQ1

LOT-SIZING OPTIMIZATION PROBLEMQ2

DYNAMIC PROGRAMMINGQ1

Abstract

In most industrial applications, determining production quantities are one of the most key decision making. In this paper, an integer MATHEMATICAL PROGRAMMING model for lot-sizing problem with considering set-up time, safety stock, shortage cost, and different production manners, is presented.The objective is to minimize summation of production, set up, holding, and shortage costs. To solve the model, a forward DYNAMIC PROGRAMMING (DP) approach is presented and compared with classical backward DP method.Finally, different numerical illustrations with different dimension are generated. The statistical analysis on computational results showed that the proposed DP approach is more applicable than the classical DP in terms of computational time.

Cites

No record.

References

No record.

Cite

APA: Copy

HAJIPOUR, VAHID, MOHAMMADIZADEH, MOHAMMADREZA, & ABBASI, MORTEZA. (2016). AN EFFICIENT DYNAMIC PROGRAMMING APPROACH TO OPTIMIZE CAPACITATED LOT-SIZING PROBLEM. ADVANCES IN MATHEMATICAL MODELING, 6(1), 89-102. SID. https://sid.ir/paper/243911/en

Vancouver: Copy

HAJIPOUR VAHID, MOHAMMADIZADEH MOHAMMADREZA, ABBASI MORTEZA. AN EFFICIENT DYNAMIC PROGRAMMING APPROACH TO OPTIMIZE CAPACITATED LOT-SIZING PROBLEM. ADVANCES IN MATHEMATICAL MODELING[Internet]. 2016;6(1):89-102. Available from: https://sid.ir/paper/243911/en

IEEE: Copy

VAHID HAJIPOUR, MOHAMMADREZA MOHAMMADIZADEH, and MORTEZA ABBASI, “AN EFFICIENT DYNAMIC PROGRAMMING APPROACH TO OPTIMIZE CAPACITATED LOT-SIZING PROBLEM,” ADVANCES IN MATHEMATICAL MODELING, vol. 6, no. 1, pp. 89–102, 2016, [Online]. Available: https://sid.ir/paper/243911/en

Related Journal Papers