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

Abstract

-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.

Shielding effectiveness and S<inf>21</inf> of a rectangular enclosure with aperture and wire penetration

“…Step 1: Evaluate the bottleneck dominance level of P(1,j) compared to P(4,j) + P(5,j) + P(6,j) as described in [16]. This is to ensure that P (1,j) is the dominant bottleneck because BAM4 heuristic is more appropriately applicable for this type of bottleneck.…”

“…First, the P1 bottleneck dominance level is evaluated. This dominance level is measured by detecting the number of occurrences where P1+P2+P3 (or P123) of any job is greater than P2+P3+P4+P5+P6 (or P23456) of other jobs [16]. Table 2 shows the values of P123 and P23456 whereas the occurrences of P123 > P23456 is shown in Table 3.…”

“…This section discusses the simulated results of the BAM4 heuristic performance under groups of weak, medium and strong dominance level values as described in [16]. The performance evaluation was first simulated using groups of 6 jobs waiting to be scheduled.…”

“…The problem studied in this research can be identified as four machine permutation re-entrant flow shop with the processing route of M1,M2,M3,M4,M3,M4. Several heuristics are being developed to solve this problem and one of them which utilised the absolute bottleneck characteristic was presented in [16]. This paper presents the second version of scheduling heuristic to minimize the makespan of a reentrant flow shop with dominant characteristic at first process.…”