Skip to main content
padlock icon - secure page this page is secure

No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms

Buy Article:

$60.00 + tax (Refund Policy)

This article studies a no-wait two-stage flexible flow shop scheduling problem with setup times aiming to minimize the total completion time. The problem is solved using an adaptive imperialist competitive algorithm (AICA) and genetic algorithm (GA). To test the performance of the proposed AICA and GA, the algorithms are compared with ant colony optimisation, known as an effective algorithm in the literature. The performance of the algorithms are evaluated by solving both small and large-scale problems. Their performance is evaluated in terms of relative percentage deviation. Finally the results of the study are discussed and conclusions and potential areas for further study are highlighted.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: GA; ICA; hybrid flow shop; no-wait; setup time

Document Type: Research Article

Affiliations: Department of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, Iran

Publication date: June 1, 2013

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more