A production manager must determine the processing sequence for seven jobs through the grinding and de-burring departments. The same sequence will be followed in each department. The manager’s goal is to move the jobs through the two departments as quickly as possible. The site supervisor of the grinding department wants the SPT rule to be used to minimize the work-in-process inventory in the department. PROCESSING TIME (HOURS) Job Grinding Deburring A 3 6 B 2 4 C 1 5 D 4 3 E 9 4 F 8 7 G 6 2a. Prepare a schedule using the SPT priority rule for the grinding department (using the grinding times).multiple choice 1C-B-A-D-G-F-ED-C-B-E-F-G-AA-B-C-D-E-F-GG-D-E-A-B-C-Fb-1. What is the total flow time in the grinding department for the SPT sequence?Grinding total flow time hoursb-2. What is the make-span for the seven jobs in both the grinding and de-burring departments (using the sequence found in part a)?Make-span hoursc-1. Determine a sequence that will minimize the make-span in both departments.multiple choice 2C-B-A-F-E-D-GC-D-F-B-A-G-EA-B-C-D-E-F-GG-D-E-A-B-C-Fc-2. Does using the SPT rule in the grinding department result in smallest make-span?multiple choice 3YesNo
Question
A production manager must determine the processing sequence for seven jobs through the grinding and de-burring departments. The same sequence will be followed in each department. The manager’s goal is to move the jobs through the two departments as quickly as possible. The site supervisor of the grinding department wants the SPT rule to be used to minimize the work-in-process inventory in the department. PROCESSING TIME (HOURS) Job Grinding Deburring A 3 6 B 2 4 C 1 5 D 4 3 E 9 4 F 8 7 G 6 2a. Prepare a schedule using the SPT priority rule for the grinding department (using the grinding times).multiple choice 1C-B-A-D-G-F-ED-C-B-E-F-G-AA-B-C-D-E-F-GG-D-E-A-B-C-Fb-1. What is the total flow time in the grinding department for the SPT sequence?Grinding total flow time hoursb-2. What is the make-span for the seven jobs in both the grinding and de-burring departments (using the sequence found in part a)?Make-span hoursc-1. Determine a sequence that will minimize the make-span in both departments.multiple choice 2C-B-A-F-E-D-GC-D-F-B-A-G-EA-B-C-D-E-F-GG-D-E-A-B-C-Fc-2. Does using the SPT rule in the grinding department result in smallest make-span?multiple choice 3YesNo
Solution
a. The SPT (Shortest Processing Time) rule prioritizes jobs that have the shortest processing time. For the grinding department, the jobs in order of shortest to longest processing time are: C-B-A-D-G-F-E.
b-1. The total flow time in the grinding department for the SPT sequence is the sum of the grinding times for each job in the sequence. This is calculated as follows: C(1 hour) + B(2 hours) + A(3 hours) + D(4 hours) + G(6 hours) + F(8 hours) + E(9 hours) = 33 hours.
b-2. The make-span for the seven jobs in both the grinding and de-burring departments is the total time it takes to complete all jobs in both departments. This is calculated by adding the longest processing time in each department. In this case, the longest processing time in the grinding department is for job E (9 hours) and in the de-burring department is for job F (7 hours). Therefore, the make-span is 9 hours + 7 hours = 16 hours.
c-1. To minimize the make-span in both departments, we need to consider the processing times in both departments. The sequence that will minimize the make-span is: C-B-A-F-E-D-G.
c-2. Using the SPT rule in the grinding department does not result in the smallest make-span. This is because the SPT rule only considers the processing time in the grinding department and does not take into account the processing time in the de-burring department. Therefore, the answer is No.
Similar Questions
The following table shows jobs to be processed at a machine. Determine the processing sequence that will minimize total number of late jobs. Job Processing Time (days) Due Date (days) A 3 4 B 2 5 C 5 10 D 2 11 E 4 13 F 9 201. Job is the first job that is late in the given sequence.2. Job has the largest processing time out of these 5 jobs.3. Optimal sequence is with on
Priority rules generally assume that a job's setup time is independent of the sequence of processing jobs.Group startsTrue or FalseTrue, unselectedFalse, unselected
All priority or dispatching rules involve complex computations intended to establish an optimal processing sequence for production facilities.Group startsTrue or FalseTrue, unselectedFalse, unselected
_______ may be defined as the process of arranging the work associated with manufacturing process with a view to : i) having the optimum output, and ii) keeping a control over the entire process. ans. Dispatching Scheduling Sequencing Expediting
An agriculture equipment manufacturer has a sub-assembly production line where eight steps or tasks must be performed (outlined in the table below with all relevant information). Daily demand (required output rate) is 54 units and there are 960 minutes available each day to meet this production quota.Task Req'd Time (in minutes) Predecessor A 9 NoneB 5 AC 5 BD 7 BE 13 CF 3 CG 7 D, E, FH 3 G What is the total time (in minutes) for this production line? What is the takt time (in minutes) for this production line? (Round your answer to a one decimal place.) What is the theoretical minimum number of workstations required for this production line? (Round up your answer to the nearest whole number.) Given your task assignments to workstations, what is the actual number of workstations required? What is the cycle time (in minutes) for this production line? What is the overall efficiency for this production line? (Write your answer as a percentage, and display your answer to two decimal places.) %
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.