Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in f...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/41022/1/CHONG_ZHENG_ZIAO_24_Pages.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|