Citation
Nazif, Habibeh and Lee, Lai Soon
(2010)
Solving single machine scheduling problem with maximum lateness using a genetic algorithm.
Journal of Mathematics Research, 2 (3).
pp. 57-62.
ISSN 1916-9795
Abstract
We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. The objective is to find a schedule which minimises the maximum lateness of the jobs in the presence of the sequence independent family setup times. The results showed that the proposed algorithm is generating better quality solutions compared to other variants of genetic algorithms
Download File
Official URL or Download Paper: http://www.ccsenet.org/jmr
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Subject: | Scheduling - Mathematical models |
| Subject: | Genetic algorithms |
| Divisions: | Faculty of Science |
| Publisher: | Canadian Center of Science and Education |
| Keywords: | Genetic algorithm, Single machine scheduling |
| Depositing User: | Najwani Amir Sariffudin |
| Date Deposited: | 29 Nov 2012 06:29 |
| Last Modified: | 18 Dec 2015 03:02 |
| URI: | http://psasir.upm.edu.my/id/eprint/16776 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |