at is the idle time in the binding shop, given the optimal solution? e) H ow muc
ID: 381108 • Letter: A
Question
at is the idle time in the binding shop, given the optimal solution? e) H ow much would the binding machine's idle time be cut by splitting Job Z in half? Px 15.23 Six jobs are to be processed through a two-step opera- tion. The first operation involves sanding, and the second involves painting. Processing times are as follows: JOB OPERATION 1 (HOURS) OPERATION 2 (HOURS) 10 4 8 4 Determine a sequence that will minimize the total completi time for these jobs. Illustrate graphically. Px Additional problems 15.24-15.25 are available in MyOMLab. Problems 15.26-15.27 relate to Scheduling Services 15.26 Daniel's Barber Shop at Newark Airport is o days a week but has fluctuating demand. Daniel Ball is in sted in treating his barbers as well as he can with steady w nd preferably 5 days of work with two consecutive days is analysis of his staffing needs resulted in the following chedule Daniel's staff with the minimum number of barbersExplanation / Answer
Ans:- The two operation centers are 1 for Sanding and 2 for Painting.
The smallest time is 2 for job E at center 1, hence we start with E.
Now, next is time of 3 for D and F, since for F at center 2, last job should be F.
Thence, we take D from start after E is complete.
The sequence stands as E D _ _ _ F.
Next is B with a time of 4 at center 2. So,scheduling it from the last, we have ED_ _BF
Next is A at center 2 and C at center 1 with a time of 5. So scheduling C from first and A from last, we have
E D C A B F. This sequence will minimize the total completion time for the jobs.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.