Comparison of Approximation Heuristics with Minimizing Make-Span in Permutation Flow Shop Scheduling Environment

Sequencing and scheduling plays a very important role in service industries, planning and manufacturing system. Therefore, better sequencing and scheduling system has a significant impact on time complexity. Since, problem is NP-hard for more than two machines, effort has been made in the progress of heuristic procedures so that optimal solutions can be procured in less time interval proficient sequencing direct to enhance in utilization efficiency and hence reduce the time required to complete the jobs. In this paper, we are making an attempt to bring down the make-span and compare time complexity in m-machine flow shop environment by reducing the sequences and to find an optimal or near optimal make-span. For effective analysis, a well known heuristic algorithm that is, CDS is considered.