A Lower Bound of Mean Flow Time in Shops with Multiple Processors

복수기계를 가진 흐름생산에서 평균흐름시간의 하한에 관한 연구

Flow Shop with Multiple Processors(FSMP) scheduling involves sequencing jobs in a flow shop where, at any processing stage, there exists one or more identical processors. Any methodology to determine the optimal mean flow time for this type of problem is NP-complete. This necessitates the use of sub-optimal heuristic methods to address problems of moderate to large scale. This paper presents global lower bounds on FSMP mean flow time problems which may be used to assess the quality of heuristic solutions when the optimal solution is unknown.