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: | , |
|---|---|
| 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!
|