Problem 7-1 (Johnson algorithm). We have 5 jobs to be processed and 2 machines as servers. Each job must be processed at machine 1 first and then machine 2 later. The following table shows each jobs processing time at Machine 1 and Machine 2. Apply the Johnsons algorithm to find the optimal sequence minimizing the makespan. What is the makespan?

Problem 7-2 (Input Modeling) The table shows the time-log of customers arrival around noon on Tuesday. Please answer four questions below. We decided to use stochastic approches to model this input data.

Q.7-2A. Let X be the random variable representing inter-arrival times. Please find the following: : ___________ : ___________ : ___________ : ___________ 2: ___________ Q.7-2B. Draw Histogram. Your bucket can be: [2, 3.99], [4, 5.99], [6, 7.99], [8, 9.99]. Q.7-2C. Develop the empirical Cumulative Density Function (CDF)

Problem 7-1 (Johnson' algorithm). We have 5 jobs to be processed and 2 machines as servers. Each job must be processed at machine 1 first and then machine 2 later. The following table shows each job's processing time at Machine 1 and Machine 2. Apply the Johnson's algorithm to find the optimal sequence minimizing the makespan. What is the makespan? Problem 7-2 (Input Modeling) The table shows the time-log of customer's arrival around noon on Tuesday. Please answer four questions below. We decided to use stochastic approches to model this input data. Please feel free to use MS-EXCEL. Q.7-2A. Let X be the random variable representing inter-arrival times. Please find the following: Xmax:Xmin:Xmode:X:S2: Q.7-2B. Draw Histogram. Your bucket can be: [2, 3.99], [4, 5.99], [6, 7.99], [8, 9.99]. Q.7-2C. Develop the empirical Cumulative Density Function (CDF)