Admissions Open
Admissions Open
In the present state of affairs the current engineering and manufacturing built- up units are facing mishmash of problems in a lot of aspects such as man power, machining time, raw material, electricity and customer’s constraints. The flow-shop scheduling is one of the most significant manufacturing behaviors particularly in manufacturing planning. The creation of every time admirable schedules has verified to be enormously complicated. This paper involves the fortitude of the order of processing of m jobs on 2 machines. This paper proposes the specially structured Flow Shop Scheduling problem separated from set up time assuming that maximum of the equivalent processing time on first machine is less than or equal to the minimum of equivalent processing time on second machine with the objective of getting the optimal sequence of jobs for total waiting time of jobs using the heuristic algorithm by taking two of the jobs as a group job. The proposed technique is followed by numerical example.