114
Views
12
CrossRef citations to date
0
Altmetric
Articles

Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs

&
Pages 987-998 | Received 24 Nov 2007, Accepted 20 Apr 2009, Published online: 24 Sep 2009
 

Abstract

Bi-criteria improved genetic algorithm (IGA) for flowshop scheduling problem is proposed in this paper. The primary concern of flowshop scheduling problem considered in this work is to obtain the best sequence, which minimises the makespan and total flow time of all jobs. The initial population of the genetic algorithm is created using popular NEH constructive heuristic (Nawaz et al. Citation1983). In IGA, multi-crossover operators and multi-mutation operators are applied randomly to subpopulations divided from the original population to enhance the exploring potential and to enrich the diversity of the crossover templates. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library. Computation results based on some permutation flowshop scheduling benchmark problems (OR-Library) show that the IGA gives better solution when compared with the earlier reported results.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 528.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.