Johnsons algorithm This algorithm gives only academic Optimal schedules for two machine problem; This algorithm

cannot deal with fuzzy processing times. Bad assumptions like, All jobs available at the start of problem, deterministic process times, No preemption of jobs, No setup time, No machine breakdowns

CDS algorithm CDS algorithm is extended version of Johnson's algorithm to solve an m-machines flow shop problem which can deal with fuzzy processing times. Constructive Heuristics approach with the Objective of Minimizing Make span in the Flow Shop Scheduling.