A Bi-objective Simulation-optimization Approach for Solving a No-wait two Stages Flexible Flow Shop Scheduling Problem with Rework Ability

Mohammad Rahmanidoust and Jianguo Zheng

International Business Research, 2017, vol. 10, issue 12, 197-221

Abstract: The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.

Keywords: multi-objective optimization; no wait; flexible flow shop; NSGA-II; MOICA; PAES (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/ibr/article/view/70816/39298 (application/pdf)
http://www.ccsenet.org/journal/index.php/ibr/article/view/70816 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:ibrjnl:v:10:y:2017:i:12:p:197-221

Access Statistics for this article

More articles in International Business Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().