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: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
EuroJournals
2009
|
| 在線閱讀: | 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/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Universiti Putra Malaysia |
| 語言: | English |