Answer on Question #47102 – Math - Algorithms | Quantitative Methods
A book binder has one printing press, one binding machine and manuscripts of seven different books. The time required for performing printing and binding operations for different printing and binding operations for different books are shown below:
Book 1 2 3 4 5 6 7
Printing Time (Days) 20 90 80 20 120 15 65
Binding Time (Days) 25 60 75 30 90 35 50
Find the optimum sequence of processing of the jobs that minimises the total time required. Also compute the optimal time required.
Solution
Step 1. Minimum time is 15 days on printing press for job 6 so it will be sequenced earlier as shown
Step II. Now book 1 and 4 have the least time of 20 days on printing press so these two books will be sequenced as
Step III. After eliminating job 6, 1 and 4 least time is for job 7 on binding machine so it will be placed last in the sequence.
Step IV. Now book 2 has least time of 60 on , hence it will be placed at the end.
Step V. Book 3 has the least time of 75 days on so it will be placed as below.
Step VI. Jobs 5 will be placed in the vacant place
Step VII. Total processing time can be calculated as follow:
**Total idle time**
Printing = (460 - 410) = 50 days as the printing of last job (7) is finished on 410 days but binding finishes only after 460 days, so printing machine is idle for 50 days.
Binding = 15 + 70 + 5 + 5 = 95 days
www.AssignmentExpert.com
Comments
Dear Yuvraj, please use the panel for submitting a new question.
Jai Hind Industry uses MRP for its material planning. The table below provides the information about a particular component Z. The demand for this component is uncertain and in order to take care of the sudden spurt in the demand, a safety stock of 100 items if recommended. Week Weeks 1 2 3 4 5 6 7 Requi reme 50 nts 100 80 200 50 40 100 Order Quantity 300 on hand stock 300 2 weeks