Elective and Bonus Problem (5 Points) A flow shop with parallel processors consists of m processing stages in series with unlimited parallel identical machines, as shown in the figure. In the line n parts of various types are processed. must be processed in stage 1 through stage m in that order. Each part requires m operations, cach on input sequence in which the parts enter the line, that is, a so-called permutation flow shop is The main decisions in the operation of the flow shop are assign and schedule the parts to the machines in each stage, that is, to determine the order in which the parts are to be processed on the different machines of each stage. Propose a methodology for achieving such decisions such that all the parts are completed in a minimum time that is to minimize the makespan? 1 Stage 1 Stage 2 A flow shop with parallel processors. em Processing with preemption indicates that part k completed in stage i at time cix had started his processing in that stage at time cik Pia, where; Cik - is completion time of part k in stage i, and pir is the processing time of part k in stage i. Formulate the operations research model of the flow shop