Economic lot scheduling problem with allowable shortage: A multi-objective approach

V. Kayvanfar*, M. Zandieh, I. Mahdavi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

Economic lot scheduling problem (ELSP) in a multi-objective approach is surveyed in this study regarding deteriorating items and allowable shortage using extended basic period (EBP) approach under Power-of-Two (PoT) policy. The goal of this research is minimizing number of items stock out throughout each period and cost of such schedule, i.e. setup cost and holding cost including deteriorating factor. Two multi-objective algorithms, i.e., non-dominated sorting genetic algorithm (NSGAII) and non-dominated ranking genetic algorithms (NRGA) is employed to approach this goal. Computational experiments demonstrate that these meta-heuristic multi-objective algorithms can solve such a problem with satisfactory results.

Original languageEnglish
Title of host publication2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management, IE and EM 2011
Pages920-923
Number of pages4
EditionPART 2
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management, IE and EM 2011 - Changchun, China
Duration: 3 Sept 20115 Sept 2011

Publication series

Name2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management, IE and EM 2011
NumberPART 2

Conference

Conference2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management, IE and EM 2011
Country/TerritoryChina
CityChangchun
Period3/09/115/09/11

Keywords

  • Deterioration factor
  • economic lot scheduling problem (ELSP)
  • multi-objective algorithms

Fingerprint

Dive into the research topics of 'Economic lot scheduling problem with allowable shortage: A multi-objective approach'. Together they form a unique fingerprint.

Cite this