OPERATIONS MANAGEMENT (LL) W/CONNECT
14th Edition
ISBN: 9781265502942
Author: Stevenson
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 6, Problem 6P
Twelve tasks, with times and precedence requirements as shown in the following table, are 10 be assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight, and (2) most following tasks. In each case, the tiebreaker will be shortest processing time.
a. Draw the precedence diagram for this line.
b. Assign tasks to stations under each of the two rules.
c. Compute the percentage of idle tune fox each rule.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Eight 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
Average
Eight jobs have arrived in the following order:
Job Processing Time Due Date
1
25
11
12
9
2
3
4
5
6
7
8
9
5
11
st
4
10
7
16
6
18
16
Find and compare the performance measures for the following sequencing rules using the Excel Sequencing template.
Round your answers to two decimal places.
A. Process in the order they have arrived
24
42
Average
Flow Time Lateness Tardiness
Average
B. Shortest processing time
The SPT sequence is 4, 2, 8, 6, 1, 5, 3, 7
Flow Time Lateness Tardiness
Average
Earliest due date
The EDD sequence is 4, 2, 3, 8, 5, 6, 1, 7
Flow Time Lateness Tardiness
A group of six jobs is to be processed through a two-machine flow shop. The first operation involves cleaning and the second involves painting. Determine a sequence that willminimize the total completion time for this group of jobs. Processing times are as follows:PROCESSING TIME (hours)Job Work Center 1 Work Center 2A 5 5B 4 3C 8 9D 2 7E 6 8F 12 15 To employ Johnson’s rule, create a “blank” sequence first, such as:mhhe.com/stevenson13eEXAMPLE 41st 2nd 3rd 4th 5th 6th
Chapter 6 Solutions
OPERATIONS MANAGEMENT (LL) W/CONNECT
Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.3 - FOXCONN SHIFTS ITS FOCUS TO AUTOMATION Foxconn...Ch. 6.3 - FOXCONN SHIFTS ITS FOCUS TO AUTOMATION Foxconn...Ch. 6.3 - Prob. 2.1RQCh. 6.3 - Prob. 2.2RQ
Ch. 6.3 - Prob. 3.1RQCh. 6.3 - Prob. 3.2RQCh. 6.5 - Prob. 1.1RQCh. 6.5 - Prob. 1.2RQCh. 6 - Explain the importance of process selection in...Ch. 6 - Briefly describe the five process types, and...Ch. 6 - Prob. 3DRQCh. 6 - Briefly describe computer-assisted approaches to...Ch. 6 - What is a flexible manufacturing system, and under...Ch. 6 - Prob. 6DRQCh. 6 - Why might the choice of equipment that provides...Ch. 6 - Prob. 8DRQCh. 6 - Prob. 9DRQCh. 6 - Briefly describe the two main layout types.Ch. 6 - Prob. 11DRQCh. 6 - Prob. 12DRQCh. 6 - What is the goal of Line balancing? What happens...Ch. 6 - Why are routing and scheduling continual problems...Ch. 6 - Prob. 15DRQCh. 6 - Prob. 16DRQCh. 6 - The City Transportation Planning Committee must...Ch. 6 - Identify the fixed-path and variable-path...Ch. 6 - Prob. 19DRQCh. 6 - Prob. 20DRQCh. 6 - Prob. 21DRQCh. 6 - Prob. 22DRQCh. 6 - What is cellular manufacturing? What are its main...Ch. 6 - Prob. 24DRQCh. 6 - Prob. 25DRQCh. 6 - Prob. 1TSCh. 6 - What trade-offs are involved when deciding how...Ch. 6 - Who needs to be involved in process selection?Ch. 6 - Prob. 4TSCh. 6 - Prob. 5TSCh. 6 - Prob. 1CTECh. 6 - Prob. 2CTECh. 6 - What are the risks of automating a production...Ch. 6 - Consider an assembly line such as the burrito...Ch. 6 - Prob. 1PCh. 6 - A manager wants to assign tasks to workstations as...Ch. 6 - A manager wants to assign tasks to workstations as...Ch. 6 - A producer of inkjet printer is planning to add a...Ch. 6 - As part of a major plant renovation project, the...Ch. 6 - Twelve tasks, with times and precedence...Ch. 6 - For the given set of tasks, do the following: a....Ch. 6 - A shop works a 400-minute day. The manager of the...Ch. 6 - Arrange six departments into a 2 3 grid so that...Ch. 6 - Using the information given in the preceding...Ch. 6 - Using the information in the following grid,...Ch. 6 - Arrange the eight departments shown in the...Ch. 6 - Arrange the departments so they satisfy the...Ch. 6 - a. Determine the placement of departments fix a...Ch. 6 - Prob. 15PCh. 6 - Develop a process layout that will minimize the...Ch. 6 - Prob. 17PCh. 6 - Rebalance the assembly line in Problem 7. This...
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
- Given the following information, assign tasks to work stations using the most followers rule. Assume the cycle time is 60 seconds and the minimum number of workstations is 3. Submit for each workstation (1,2,3,4 etc.), the tasks assigned in order of assignment, the idle time for each work station and the total idle time. (It will help for you to make the diagram but you are not required to submit the diagram) Task A D w Immediate Predecessor D CE Task Time (seconds) 35 50 20 10 25 40arrow_forwardGlaudious is 45 years old university internship coordinator. He is handling 80 interns and he would like to perform the following tasks in an easy and fast way. He also encountered an accident a year ago which caused his right leg to have a bone minor fracture which caused him to limit the place he can go. He would like that he can perform the tasks anytime and anywhere. Below are the tasks of Prof Glaudios. 1) He registers the students undergoing internship, this includes the term in a schoolyear, the company name where the student is undergoing internship, directsupervisor of the intern, start of duty, Number of Hours of duty per day, andthe Job of the student-intern in the company. 2) He will also view the following: a) Individual internship record in a term-sem-school year b) Interns details in a company Based on the scenario above, model the tasks of Prof Glaudious by creating a Task Analysis.arrow_forwardThere are six jobs as below. The processing time (in days) and due date for each job are below. Job lamolam A B C D E F (a) the average flow time Processing Time (days) (b) average tardiness 1 16 4 10 5 8 Due Date (days from present time) Please use SPT (shortest processing time) priority rule to calculate: 7 16 4 15 10 18 (c) average number of jobs at the work center, for each of these rules:arrow_forward
- Glaudious is 45 years old university internship coordinator. He is handling 80 interns and he would like to perform the following tasks in an easy and fast way. He also encountered an accident a year ago which caused his right leg to have a bone minor fracture which caused him to limit the place he can go. He would like that he can perform the tasks anytime and anywhere. Below are the tasks of Prof Glaudios. 1) He registers the students undergoing internship, this includes the term in a schoolyear, the company name where the student is undergoing internship, directsupervisor of the intern, start of duty, Number of Hours of duty per day, andthe Job of the student-intern in the company. 2) He will also view the following: a) Individual internship record in a term-sem-school year b) Interns details in a company using the Professor Glaudious Scenario, provide the requirements specification: a. Functional b. Data c. Environmental d. User e. Usabilityarrow_forward1.Explain the concepts of scheduling and sequencing 2.Describe staff scheduling and appointment system decisions 3.Describe how to solve two-resource sequencing problems.arrow_forwardThere are six jobs as below. The processing time (in days) and due date for each job are below. Job |arrow_forwardFour automobiles have entered Bubba’s Repair Shop for various types of work, ranging from a transmis-sion overhaul to a brake job. The experience level of the mechanics is quite varied, and Bubba would liketo minimize the time required to complete all of thejobs. He has estimated the time in minutes for eachmechanic to complete each job. Billy can completejob 1 in 400 minutes, job 2 in 90 minutes, job 3 in60 minutes, and job 4 in 120 minutes. Taylor willfinish job 1 in 650 minutes, job 2 in 120 minutes, job3 in 90 minutes, and job 4 in 180 minutes. Mark willfinish job 1 in 480 minutes, job 2 in 120 minutes, job3 in 80 minutes, and job 4 in 180 minutes. John willcomplete job 1 in 500 minutes, job 2 in 110 minutes,job 3 in 90 minutes, and job 4 in 150 minutes. Eachmechanic should be assigned to just one of these jobs.What is the minimum total time required to finish thefour jobs? Who should be assigned to each job?arrow_forwardGiven the following information, assign tasks to work stations using the most followers rule. Assume the cycle time is 60 seconds. Submit for each workstation (1,2,3 etc.), the tasks assigned in order of assignment, the idle time for each work station and the total idle time. (It will help for you to make the diagram but you are not required to submit the diagram) Immediate Task Task Time (seconds) Predecessor 35 50 A. 20 10 25 F\ C.E 40 Edit Format Table Paragraph V BIUA 12pt v Immediate Predecessor Task Time (seconds) Taskarrow_forwardThe times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B. TIME (hours) Job Machine A Machine B a 16 5 b 3 13 c 8 7 d 9 6 e 2 14 f 14 4 g 18 14 h 20 11 Find machine B’s idle time For the sequence determined in part a, how much would machine B's idle time be reduced by splitting the last two jobs in half?arrow_forwardI only need help with question 4, but question 3 explains how to do 4 but I'm lost. I already have question 3 done. 3. Sequence the jobs shown below by using a Gantt chart. Assume that the move time between machines is one hour. Sequence the jobs in priority order 1, 2, 3, 4. Job Work Center/Machine Hours Due Date (days) Job 1 A/3, B/2, C/2 Job 2 C/2, A/4 Job 3 B/6, A/1, C/3 Job 4 C/4, A/1, B/2 a. What is the makespan? b. How much machine idle time is there? c. When is each job delivered compared with its due date? d. How much idle time (waiting time) is there for each job? e. Devise a better job sequence for processing. 4. In problem 3, assume there are two machines of type A, two of type B, and two of type C. a. Prepare a finite capacity schedule. b. Compare the FCS to the Gantt chart in problem 3.arrow_forwardThe three-station work cell at Pullman Mfg., Inc. is illustrated in the figure below. It has two machines at station 1 in parallel (i.e., the product needs to go through only one of the two machines before proceeding to station 2). 20 min/unit Station 1 Machine A Station 1 Machine B 20 min/unit Station 2 12 min/unit b) The bottleneck time of this work cell is number). Station 3 6 min/unit a) The throughput time is minutes (enter your response as a whole number). minutes per unit (enter your response as a whole c) is the bottleneck station. d) If the firm operates 8 hours per day, 6 days per week, the weekly capacity of this work cell is units (enter your response as a whole number).arrow_forwardA B1 B2 B3 C1 C2 C3 D1 D2 D3 E A service process is described by the above flowchart. After going through workstation A, an order needs to be processed by one of the three lines, B1-C1-D1, B2-C2-D2, or B3-C3-D3 (in other words, they are substitutable). Finally, all orders need to go through workstation E. The capacities of the individual workstations are given as follows: Workstation A has a capacity of 3 orders/hour • Workstation B1, B2, and B3 have the same capacity of 4 orders/hour • Workstation C1, C2, and C3 have the same capacity of 3 orders/hour • Workstation D1, D2, and D3 have the same capacity of 4 orders/hour • Workstation E has a capacity of 6 orders/hour What is process time of this service process in minutes?arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY