Open Access Open Access  Restricted Access Subscription or Fee Access

Minimization of maximum tardiness in a no-wait two stage flexible flow shop

Nazanin Moradi nasab, Rasoul Shafaei, Meysam Rabiee, Mostafa Mazinani

Abstract


This paper discuses about no wait two stage multiprocessor flow shop scheduling problem. The haracteristics of this problem are unit setup times and rework probability for jobs after second stage. The problem investigated in this study belong to NP-hard classes of scheduling problem, Therefore, two novel metaheuristics namely discrete particle swarm optimization and imperialist competitive algorithm are utilized to solve this problem. The performance measure considered is mean tardiness. In order to evaluate the performance of the proposed algorithms, at first some
experiments are generated randomly and then the results obtained using the proposed algorithms are compared with those of ant colony optimization and genetic algorithm. Results are compared in terms of relative deviation index. The results of the simulation study reveal that the proposed ICA outperforms the other algorithms.

Keywords


ICA, PSO, No-wait, Flexible flow shop.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.

thentic information.