A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability release_xvneptppifgg3d5fesvx24phgi

by Mohammad Rahmanidoust

Published in International Business Research by Canadian Center of Science and Education.

2017   Volume 10, Issue 12, p197

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.
In application/xml+jats format

Archived Files and Locations

application/pdf  1.3 MB
file_6in64nl47fe45nxilksaplv47q
web.archive.org (webarchive)
web.archive.org (webarchive)
www.ccsenet.org (web)
pdfs.semanticscholar.org (aggregator)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2017-11-16
Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  1913-9004
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 451ca432-69ab-4b85-a259-5e2d244b17cb
API URL: JSON