2012
DOI: 10.1186/2251-712x-8-27
|View full text |Cite|
|
Sign up to set email alerts
|

Retracted: Using genetic algorithm approach to solve a multi-product EPQ model with defective items, rework, and constrained space

Abstract: The article was mistakenly published due to a workflow error although it had not been accepted by the Editorial Board of the journal. Springer accepts full responsibility for this and would like to apologize to the authors of the article as well as the Editors and readers of the journals.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…The same authors in [26] developed two memetic-based metaheuristics to solve this problem with additional discounts, and compared their efficiency with the parameter-tuned genetic algorithm. Many other examples of multiproduct inventory problem variations and solving methods are presented in recent papers [27][28][29][30][31][32][33][34][35]. Kotb [27], solved a multi-item inventory lot size model with limited storage space and set up cost constraints with varying holding cost using geometric programming approach, while for solving a similar problem Vasanthi and Seshaiah [28] used Karush Kuhn Tucker conditions.…”
Section: Introductionmentioning
confidence: 99%
“…The same authors in [26] developed two memetic-based metaheuristics to solve this problem with additional discounts, and compared their efficiency with the parameter-tuned genetic algorithm. Many other examples of multiproduct inventory problem variations and solving methods are presented in recent papers [27][28][29][30][31][32][33][34][35]. Kotb [27], solved a multi-item inventory lot size model with limited storage space and set up cost constraints with varying holding cost using geometric programming approach, while for solving a similar problem Vasanthi and Seshaiah [28] used Karush Kuhn Tucker conditions.…”
Section: Introductionmentioning
confidence: 99%
“…This model contained a non-linear integer programming problem and found an optimal solution for the available warehouse by adding space constraints. Through a genetic algorithm with a non-linear cost function and space constraint, a multi-stage inventory model was discussed by Hafshejani et al [25]. An inventory model considering demand and limited space availability, where reliability depends on the unit production costs, was introduced by Mahapatra et al [26].…”
Section: Introductionmentioning
confidence: 99%
“…They found the optimal solution of the model within the available warehouse space by adding a space constraint. Hafshejani et al [24] solved a multi-stage inventory model with a nonlinear cost function and space constraint through a genetic algorithm. Mahapatra et al [25] introduced an inventory model with demand and reliability dependent unit production cost under limited space availability.…”
Section: Introductionmentioning
confidence: 99%