Optimized Crossover Genetic Algorithm to Minimize the Maximum Lateness of Single Machine Family Scheduling Problems

Habibeh Nazif and Lee Lai Soon

Journal of Asian Scientific Research, 2012, vol. 2, issue 5, 240-253

Abstract: We address a single machine family scheduling problem where jobs are partitioned into families and setup time is required between these families. For this problem, we propose a genetic algorithm using an optimized crossover operator to find an optimal schedule which minimizes the maximum lateness of the jobs in the presence of the sequence independent family setup times. The proposed algorithm using an undirected bipartite graph finds the best offspring solution among an exponentially large number of potential offspring. Extensive computational experiments are conducted to assess the efficiency of the proposed algorithm compared to other variants of local search methods namely dynamic length tabu search, randomized steepest descent method, and other variants of genetic algorithms. The computational results indicate the proposed algorithm is generating better quality solutions compared to other local search algorithms.

Keywords: Genetic algorithm; Single machine scheduling; Maximum lateness (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://archive.aessweb.com/index.php/5003/article/view/3347/5358 (application/pdf)

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:asi:joasrj:v:2:y:2012:i:5:p:240-253:id:3347

Access Statistics for this article

More articles in Journal of Asian Scientific Research from Asian Economic and Social Society
Bibliographic data for series maintained by Robert Allen ().