Abstract
This paper deals with the scheduling problems which minimize the total production time for two stage flow shop with parallel machines. Two algorithms are proposed. The one is based on the branch and bound method for determining optimal schedules, the other is a heuristic procedure which can generate near optimal solutions to small problems and perform better than FCFS rule on large problems. Computational results are given which indicate the effectiveness of this algorithms.
