A proposed algorithm based on linear programming approach for three-stage three jobs flow shop scheduling with criteria : minimize makespan

This research has proposed an algorithm to find the optimal schedule for three jobs in flow shop environment with three stages , so that the makespan is less than what can be.This algorithm is based on the linear programming approach in computing the makespan ,the objective function and constraints have been formulated under the conditions of precedence between operations in flow shop environment .After applying this algorithm on several problems which are generated randomly by uniform distribution ,the results showed that the makespan which is computed by the proposed algorithm is equivalent to other scheduling algorithms .