Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine
This paper presents a scheduling heuristic to minimize the makespan of a re-entrant flow shop using bottleneck analysis. The heuristic is specifically intended for the cyber manufacturing centre (CMC) which is an Internetbased collaborative design and manufacturing between the Universiti Tun Hussein...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/258/ http://eprints.uthm.edu.my/258/1/s_a_bareduan.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a scheduling heuristic to
minimize the makespan of a re-entrant flow shop using
bottleneck analysis. The heuristic is specifically intended for the cyber manufacturing centre (CMC) which is an Internetbased collaborative design and manufacturing between the Universiti Tun Hussein Onn Malaysia and the small and medium enterprises. The CMC processes scheduling
resembles a four machine permutation re-entrant flow shop
with the process routing of M1,M2,M3,M4,M3,M4 in which
the first process at M1 has high tendency of exhibiting
dominant characteristic. It was shown that using bottleneckbased analysis, an effective constructive heuristic can be developed to solve for near-optimal scheduling sequence. At strong machine dominance level and medium to high job,numbers, this heuristic shows slightly better makespan performance compared to the NEH. However, for smaller job numbers, NEH is superior. |
|---|