期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2012
卷号：3
期号：3
页码：81-93
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy of the makespan computation. Using these correction factors, a constructive heuristic was developed to solve for near-optimal scheduling sequence. For small size problems, the heuristic results were compared with the optimum makespan generated from complete enumeration. For medium and large size problems, the heuristic performance was measured by comparing its makespan with the solutions generated by the NEH and lowerbound. At weak and strong dominance level, the heuristic shows good performance against the lowerbound and better results compared to the NEH for large and medium size problems.
