Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

摘要

This paper presents a scheduling heuristic tominimize the makespan of a re-entrant flow shop usingbottleneck 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 schedulingresembles a four machine permutation re-entrant flow shopwith the process routing of M1,M2,M3,M4,M3,M4 in whichthe first process at M1 has high tendency of exhibitingdominant 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.