Sixteen jobs must be processed by two machines sequentially. Each job is process

Question

Sixteen jobs must be processed by two machines sequentially. Each job is processed by machine 1 first. After the job is processed by machine 1, a robot moves the job from machine I to machine 2. The job is then processed by machine 2 before it is moved to the inventory by the robot. Figure 1 below shows process times (in seconds) of the two machines and robot movements. A job may stay in machine 1 or machine 2 longer than the required process time. Machine 1 can process only one job at any time. Machine 2 has an unlimited capacity. There only one robot and the robot can move only one job at any time. All jobs must use the same amount of time for the same process. Please formulate an integer programming model to determine the schedule that minimizes the total flow time of completing all 16 jobs. Please use GAMS to find the optimal solution and optimal value. 50 540 160 220 Start Machine 1Machine 2In Figure 1. Process Times of a Manufacturing System

Explanation / Answer

Algorithm to provide a solution for 2 – machine n – jobs is as follows :-

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

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