Optimization of production scheduling in two stage Flow Shop Scheduling problem with m equipotential machines at first stage

Scheduling jobs on equipotential machines is an activity that is very much a part of industrial scheduling. This research reports a methodology for minimizing the make span and operating cost of machineries in flow shop scheduling problem with m-equipotential machineries at first stage in addition single machine at second stage. In our research, we develop an algorithm for finding the optimal schedule for two stage flow shop scheduling problem using branch and bound technique. Modified distribution method is applied to find the optimum allocation of processing time of jobs to equipotential machines. The procedure helps the manager to reduce the time of manufacturing and overall production cost.