a) Using the FCFS (first come, first served ) decision rule for sequencing the jobs, the order is (assume that jobs came in the order in The following jobs are waiting to be processed at the same machine center. Jobs are logged as they arrive: All dates are specified as manufacturing planning calendar days. Assume that all jobs arrive on day 275 . Assume each job starts at the beginning of the day and finishes at the end of the day (a job that begins on day 275 and takes 8 days will finish on day 282 , at the beginning of the day and finishes at the end of the day (a job that begins on day 275 and takes 8 days and the next job begins in the morning of day 283). Compute all times based on initiating work on day 275 . a-b) Using Johnson's rule for 2-machine scheduling, the sequence is The following set of seven jobs is to be processed through two work centers at George Heinrich's printing company. The sequence Use the assignment algorithm to solve this problem. Determine the optimal assignments