Solving single machine scheduling problem with maximum lateness using a genetic algorithm
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 whi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Canadian Center of Science and Education
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/16776/1/Solving%20single%20machine%20scheduling%20problem%20with%20maximum%20lateness%20using%20a%20genetic%20algorithm.pdf http://psasir.upm.edu.my/id/eprint/16776/ http://www.ccsenet.org/jmr |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English English |