A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time
In this paper, we address a single machine family scheduling problem where jobs, each characterised by a processing time and an associated positive weight, are partitioned into families and setup time is required between these families. For this problem, we propose a genetic algorithm using an optim...
Saved in:
Main Authors: | Nazif, Habibeh, Lee, Lai Soon |
---|---|
Format: | Article |
Language: | English |
Published: |
EuroJournals
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/12701/1/A%20genetic%20algorithm%20on%20single%20machine%20family%20.pdf http://psasir.upm.edu.my/id/eprint/12701/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A genetic algorithm to minimise the maximum lateness on a
single machine family scheduling problem
by: Lee, Lai Soon, et al.
Published: (2009) -
Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
by: Lee, Lai Soon, et al.
Published: (2010) -
Solving single machine scheduling problem with maximum lateness using a genetic algorithm
by: Nazif, Habibeh, et al.
Published: (2010) -
Optimized crossover genetic algorithm for vehicle routing problem with time windows
by: Nazif, Habibeh, et al.
Published: (2010) -
Optimised crossover genetic algorithm for capacitated vehicle routing problem
by: Nazif, Habibeh, et al.
Published: (2012)