Optimization of Permutation Flow Shop with Multi-Objective Criteria (original) (raw)

The flowshop scheduling is concerned with allocation of available resources over a period of time with an optimum objective. The objective may be one or more like minimizing makespan, idle time and/or total flow time. Many researchers proposed various algorithms to achieve these objectives through an optimal sequence in a Permutation Flow Shop (PFS). For identifying an optimum sequence for 'n' jobs in 'm' machines, n! sequences are to be worked. Due to the limitation in computing capabilities, the new heuristics are required to identify an optimal sequence. This paper deals with the heuristic to get an optimal or near to optimal sequence in the PFS. An algorithm is newly proposed with an exponential function of mathematical and computational aspects to validate the optimal sequence. The makespan and total flow time of the newly proposed heuristic is compared with one of the well-known classical algorithm called Gupta algorithm. The various sizes of PFS problems are s...