Statement (I): A two–machine n–job sequencing problem with all jobs having same machine sequence is an example of sequencing problem in a flow shop
Statement (II): All the flow shop problems can be optimally sequenced to minimize make span using Johnson’s rule