Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach
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...
Main Authors: | , |
---|---|
Format: | Article |
Published: |
Sistema de Información Científica Redalyc
2012
|
Subjects: | |
Online Access: | http://www.redalyc.org/articulo.oa?id=265224452007 http://www.redalyc.org/articulo.oa?id=265224452007 |