OPERATIONS MANAGEMENT W/ CNCT+
12th Edition
ISBN: 9781259574931
Author: Stevenson
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 16, Problem 21P
Summary Introduction
To determine: The sequence that would minimize the total set up time.
Introduction:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
The following table contains order-dependent setup times for four jobs. For safety reasons, jobC cannot follow job A, nor can job A follow job C. Determine the processing sequence that willminimize the total setup time. (Hint: There are 12 alternatives.)Following Job’sSetup Time (hrs.)SetupTime (hrs.) A B C DPrecedingjobA 2 — 5 × 4B 1 7 — 3 2C 3 x 2 — 2D 2 4 3 6 —
A manutacturer is designing a product layout for a new product production. It plans to use a production line for B hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 lasks in total. These tasks are namely, A, 8, CD, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed Starting tasks Cneeds, the tack B to be completed. Also, starting task D needed task B to be completed Task E can only start upon completion of Task C. Whescas starting lask F needs the completion of both the tasks D and E Finally, starting task G needed, task Fto be completed. 1the processing times for tasks, A BC D, E F, andG are 28, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks nule for balancing the assembly line, with ties broken according to longest task time first, the tasks that will be assigned to the FIRST workstation are Select one OaAB, and C ODAB Oc None…
Using the information presented in the following table, identify the processing sequence that wouldresult using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, determine (1) average jobflow time, (2) average job tardiness, and (3) average number of jobs in the system. Jobs are listedin order of arrival. (Hint: First determine the total job time for each job by computing the total processing time for the job and then adding in the setup time. All times and due dates are in hours.)JobProcessingTime per UnitUnitsper JobSetupTimeDueDatea .14 45 0.7 4b .25 14 0.5 10c .10 18 0.2 12d .25 40 1.0 20e .10 75 0.5 15
Chapter 16 Solutions
OPERATIONS MANAGEMENT W/ CNCT+
Ch. 16 - Why is scheduling fairly simple for repetitive...Ch. 16 - Prob. 2DRQCh. 16 - What are Gantt charts? How are they used in...Ch. 16 - Prob. 4DRQCh. 16 - Briefly describe each of these priority rules: a....Ch. 16 - Why are priority rules needed?Ch. 16 - What problems not generally found in manufacturing...Ch. 16 - Explain forward and backward schedulings and each...Ch. 16 - Prob. 9DRQCh. 16 - Prob. 10DRQ
Ch. 16 - Prob. 11DRQCh. 16 - What general trade-offs are involved in sequencing...Ch. 16 - Prob. 2TSCh. 16 - Prob. 3TSCh. 16 - One approach that can be effective in reducing the...Ch. 16 - Doctors and dentists offices frequently schedule...Ch. 16 - Prob. 3CTECh. 16 - Use the assignment method to determine the best...Ch. 16 - Rework Problem 1, treating the numbers in the...Ch. 16 - Assign trucks to delivery routes so that total...Ch. 16 - Develop an assignment plan that will minimize...Ch. 16 - Use the assignment method to obtain a plan that...Ch. 16 - The following table contains information...Ch. 16 - Using the information presented in the following...Ch. 16 - The following table shows orders to be processed...Ch. 16 - A wholesale grocery distribution center uses a...Ch. 16 - The times required to complete each of eight jobs...Ch. 16 - Prob. 11PCh. 16 - A shoe repair operation uses a two-step sequence...Ch. 16 - The following schedule was prepared by the...Ch. 16 - The production manager must determine the...Ch. 16 - A foreman has determined processing times at a...Ch. 16 - Given the information in the following table,...Ch. 16 - Given the following information on job times and...Ch. 16 - Prob. 18PCh. 16 - The following table contains order-dependent setup...Ch. 16 - The following table contains order-dependent setup...Ch. 16 - Prob. 21PCh. 16 - Given this information on planned and actual...Ch. 16 - Given the following data on inputs and outputs at...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Prob. 1CQ
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- In a few words, explain how to prevent a process getting starved in priority scheduling.arrow_forwardGiven the data below, using the SPT heuristic sequencing rule, determine the completion date and tardiness for each job as well as the average completion time and average tardiness for all four jobs. Which of the following statements is true? Job Processing time (days) Due date (in days) A 10 10 B 5 8 C 15 25 D 8 15 a.Jobs B and D will have no tardiness b.The tardiness for Job A is 12 days c.The average tardiness is 19.75 d.The average completion time is 6.5arrow_forwardThe following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time (min.) 110 120 220 90 180 80 Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 Makespan: minutes Average flow time: minutes In what order would the jobs be processed using the SPT rule? The SPT sequence is - - - - - . Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time.arrow_forward
- A production process at Kenneth Day Manufacturing is shown in the figure below. The drilling operation occurs separately from, and simultaneously with, the sawing and sanding, which are independent sequential operations. A product needs to go through only one of the three assembly operations (the operations are in parallel). 1. Which is the bottleneck?arrow_forwardAn order for 100 of a product is processed on operation A and operation B. The setuptime on A is 50 minutes, and the run time per piece is 9 minutes. The setup time onB is 30 minutes, and the run time is 6 minutes per piece. It takes 20 minutes to movea lot between A and B. Since this is a rush order, it is given top priority (president’sedict) and is run as soon as it arrives at either workstation.It is decided to overlap the two operations and to split the lot of 100 into two lotsof 60 and 40. When the first lot is finished on operation A, it is moved to operation Bwhere it is set up and run. Meanwhile, operation A completes the balance of the 100units (40) and sends the units over to operation B. These 40 units should arrive asoperation B is completing the first batch of 60; thus, operation B can continue withoutinterruption until all 100 are completed.a. Calculate the total manufacturing lead time for operation A and for B withoutoverlapping.b. Calculate the manufacturing lead time…arrow_forwardThe Security Life Insurance Company processes all new life insurance policies through three departments: incoming mail (I), underwriting (U), and policy control (P). Theincoming mail department receives applications and customer payments and then routes the files to the underwriting department. After checking on the applicants’qualifications for life insurance, the underwriting department forwards the file to policy control for the issue of the policy. At the present time, the company has five new policy applications waiting to be processed. The time required for processing in each department is shown below. Policy Department/Hours 1 I/3, U/6, P/8 2 I/2, P/10 3 I/1, U/3, P/4 4 I/2, U/8, P/6 5 I/1, P/6a. Prepare a Gantt chart schedule for these policies.arrow_forward
- Assign the 4 departments in Table X to locations A, B, C, and D, which are separated by the distances shown in Table y, in such a way that transportation cost is minimized. Use this heuristic: assign departments with the greatest interdepartmental workflow first. See attached tables.arrow_forwardEight jobs have arrived in the following order: Job Processing Time Due Date 1 7 23 2 3 9 3 5 8 4 2 11 5 6 16 6 9 18 7 14 40 8 4 31 Find and compare the performance measures for the following sequencing rules using the Excel Sequencing template. Round your answers to two decimal places. Process in the order they have arrived Flow Time Lateness Tardiness Averagearrow_forwardHow do you schedule 100 regular manufacturing employees working four to six-hour shifts and three skilled employees on a typical plant process? Each machine and employee must be scheduled over the day and the standard time for planning is an hour?arrow_forward
- Find the five essential factors that need to be considered when formulating a policy for the scheduling of processes, and list them below.arrow_forwardProcess D has five activities in a straight line. The cycle time for Activity 1 is 10 seconds, Activity2 is 35 seconds, Activity is 30 seconds, Activity4 is 80 seconds and Activity is 40 seconds. If activities 1, 2 and 3 are combined into one activity and assigned to one worker, and activities 4 and 5 are combined and assigned to second worker, the capacity of the system becomes ?arrow_forwardFor a given process, the raw processing time is 102 sec, the bottleneck cycle time is 20 sec/item, and the WIP is 6 items. The expected lead-time (LT) is ____ seconds. Enter a whole number answer.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY