Clustered absolute bottleneck adjacent matching heuristic for re-entrant flow shop
The problem illustrated in this paper resembles a four machine permutation re-entrant flow shop with the process routing of M1,M2,M3,M4,M3,M4 where M1 and M4 have high tendency of being the dominant machines. Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Trans Tech Publications
2014
|
| Subjects: | |
| Online Access: | https://www.scientific.net/AMM.465-466.1138 https://www.scientific.net/AMM.465-466.1138 |