1. (30 marks) Suppose a shop floor supervisor is given the task of completing 4 jobs on 3 machines as soon as possible.

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

1. (30 marks) Suppose a shop floor supervisor is given the task of completing 4 jobs on 3 machines as soon as possible.

Post by answerhappygod »

1 30 Marks Suppose A Shop Floor Supervisor Is Given The Task Of Completing 4 Jobs On 3 Machines As Soon As Possible 1
1 30 Marks Suppose A Shop Floor Supervisor Is Given The Task Of Completing 4 Jobs On 3 Machines As Soon As Possible 1 (32.92 KiB) Viewed 17 times
1. (30 marks) Suppose a shop floor supervisor is given the task of completing 4 jobs on 3 machines as soon as possible. He uses the MOST TOTAL PROCESS TIME RULE (sum of process times of the job) to sequence these jobs. process time (hr) Job M1 M2 M3 Machine Routing 1 5 7 M3-M1 2 8 4 6 M2-M1-M3 3 3 7 6 M1-M2-M3 4 9 6 5 M3-M2-M1 Show how the supervisor selects each operation in the Schedule by filling out the table below (at each decision time: candidate operations, their total process time, the chosen operation, its start time and finish time.) Time Candidate jobs Tot. Process Selected Start Finish 0 in ∞ M
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply