Abstract

In this paper, permutation flow-shop scheduling problem is solved with the objectives of minimizing total flow time. A new constructive heuristic is applied to solve the problem by using Rank Index heuristic for flow time. It is called as RIH-F approach. The proposed approach is applied on the taillard's bench mark flow-shop scheduling problem. Performance of the heuristic is measured by comparing the computational result with other heuristic approach result. All heuristic approach relative percent deviation are calculated with the best known value reported in the literature. From the computational result, the proposed approach is an alternative for the permutation flow-shop scheduling problem considering total flow time. Then the new heuristic approach is applied to demonstrate on small scale industry for flow shop environment.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call