2. Consider the following 5-job 4-machine flowshop makespan minimization problem in which all jobs and machines are available at time zero and the flow of jobs is from machine 1 through machine 4 Job MachineMachine 2 Machine 3Machine 4 18 14 25 29 28 23 25 26 25 16 1/2 (a) What is the number of all possible schedules? (b) What is the number of all possible permutation-type schedules? (c) Among all possible schedules, how many of them are enough to consider Now, consider the permutation-type schedules, answer the followings (d) Using the CDS algorithm, determine a feasible schedule and its makespan. (e) Using Machine Idle Time Method, determine a feasible schedule and its makespan. (f) Using Nawaz Heuristic, determine a feasible schedule and its makespan. (g) Is there any of optimal schedule obtained by the algorithms in parts (d) through (f)? If yes, show the critical path(s) on the Gantt chart of the optimal schedule.

2. Consider the following 5-job 4-machine flowshop makespan minimization problem in which all jobs and machines are available at time zero and the flow of jobs is from machine 1 through machine 4 Job MachineMachine 2 Machine 3Machine 4 18 14 25 29 28 23 25 26 25 16 1/2 (a) What is the number of all possible schedules? (b) What is the number of all possible permutation-type schedules? (c) Among all possible schedules, how many of them are enough