Please answer with calculation and explanation!!! The Shift Manager at a local m

Question

Please answer with calculation and explanation!!!

The Shift Manager at a local microelectronics manufacturer has 10 jobs that need to be processed through two operations. Each job is processed at Operation 1 first and then at Operation 2. Processing times in minutes for the jobs are given in Table 4.1. As soon as all jobs are processed, the Shift Manager can go home. Assume that: (1) all six jobs are available at t = 0, (2) there are no setup times, (3) there is no job preemption, (4) no job splitting and (5) no batch processing. What is the proper performance objective for this problem? What sequence would you recommend to achieve the objective in Part a.)? Explain the logic of your sequencing algorithm CLEARLY, step - by - step.

Explanation / Answer

a. the proper performance objective is to minimize the makespan time.

Makespantime is the Time required for the completion of last job.

we are using Johnson

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.