Principles Of Operations Management
11th Edition
ISBN: 9780135173930
Author: RENDER, Barry, HEIZER, Jay, Munson, Chuck
Publisher: Pearson,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 1.2VC
Summary Introduction
Case summary:
The case deals about the conversion of concert to a basketball. The details about the center were given. The available crew size is given as 16. The following information is given in the case:
To determine: The time when the floor will be ready.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
QUESTIONS:
1. A production department of a textile firm received six different orders this week. They have
calculated the processing time presented as a table (below). They have also put the due dates for
each job.
Job
с
E
B
D
F
Process.
Time
2
4
5
8
10
12
Due
Date
7
4
15
16
17
18
Based on the table please provide four sequences to complete the jobs:
a) Using first come first served (FCFS) assuming the letters represent the order they arrive (A first, B
next, then C, etc..)
b) Using shortest processing time
c) Using longest processing time
d) Using due dates
Calculate "average completion time", "average number of jobs in the system" and "average job lateness"
for all the sequences you have generated above.
What is work breakdown structure (WBS)?
Subject: HRM
What is Johari Window and why do we use it??
Chapter 15 Solutions
Principles Of Operations Management
Ch. 15 - Prob. 1EDCh. 15 - Prob. 1DQCh. 15 - Prob. 2DQCh. 15 - Prob. 3DQCh. 15 - Prob. 4DQCh. 15 - Prob. 5DQCh. 15 - Prob. 6DQCh. 15 - Prob. 7DQCh. 15 - Prob. 8DQCh. 15 - Prob. 9DQ
Ch. 15 - Prob. 10DQCh. 15 - Prob. 11DQCh. 15 - Prob. 12DQCh. 15 - Prob. 13DQCh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 13PCh. 15 - Prob. 14PCh. 15 - Prob. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 24PCh. 15 - Prob. 25PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 15 - Prob. 28PCh. 15 - Daniels Barber Shop at Newark Airport is open 7...Ch. 15 - Given the following demand for waiters and...Ch. 15 - Prob. 1CSCh. 15 - Prob. 2CSCh. 15 - Prob. 3CSCh. 15 - Prob. 4CSCh. 15 - Prob. 1.1VCCh. 15 - Prob. 1.2VCCh. 15 - Prob. 1.3VCCh. 15 - Prob. 2.1VCCh. 15 - Prob. 2.2VCCh. 15 - Why is seniority important in scheduling servers?Ch. 15 - Prob. 2.4VC
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
- QUESTION 6 The framing department has six jobs waiting to be processed as shown in Table 3 below. It is now time zero and all jobs are ready to begin. Each has only one operation remaining. Table 3 Jobs (In order of arrival) Processing Time Due Date A 5 12 B 7 18 C 8. 14 D 3 10 E 9 22 F 12 17 Using minimum flow time as the evaluation criterion, recommend the best rule to sequence the jobs from the list below: i. FCFS ii. SOT iii. EDD iv. STRarrow_forwardDevelop a solution for the following line balancing problem, allowing a cycle time of 5 minutes. Question: Balance this line using the longest task time heuristic. Work Task Task Time (seconds) Task Predecessor(s) A 70 - B 60 A C 120 B D 60 - E 240 C, D F 100 A G 190 E, Farrow_forwardQuestion 33 The processing times of five jobs are given as follows: Job Processing time (minutes) A 20 B 60 C 30 D 75 E 15 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 200 minutes. What is the average inventory if the jobs are processed in shortest processing time (SPT) order? Group of answer choices 3.00 2.92 1.97 2.20arrow_forward
- 3. The table below shows the ready time, process time and due date of 7 jobs. Job ID Ready Time Process Time Due Date 3 24 2 9 13 3 7 3 23 4 12 2 17 5 1 4 20 6 3 14 7 3 18 • Find a sequence to minimize total tardiness as much as possible (preferably below 21). • Draw your sequence on a Gantt-Chart like time-line.arrow_forwardQuestion 35 Consider the processing times and due dates of the following jobs: Job Processing time (days) Due date (days) 1 3 29 2 19 25 3 24 40 4 8 20 What is the average lateness if the earliest due date (EDD) is used to sequence the jobs? Group of answer choices 0.75 1.25 4.25 5.67arrow_forward1. Job: Installing an IT System at Bana Bank Zambia Ltd. (08-04- 2022 to 20-05- 2022) ACTIVITY WEEK NUMBER OF WORK DAYS A. Design system on the computer 1 5 B. Purchase components ? 3 C. Configure network ? 2 D. Prepare software ? 2 E. Install software ? 4 F. Assemble computers ? 7 G. Connect computers ? 3 H. Pilot test and refine system ? 2 I. Start up system, inaugurate and handover to client. ? 1 From the data given above: Prepare/draw a full Gantt Chart as at end of Week 5. Calculate and indicate the missing (?) week numbers. Indicate the completed and planned activities on the chart. Explain the shortcomings of the…arrow_forward
- Reflection Paper: Time Management Task: Time Management Plan Guide questions: 1. Explain why time management is essential in our daily routine? 2. Why are we studying time management? 3. Paraphrase how the Eisenhower Matrix came about? 4. Explain why have you chosen these activities to be plotted in the Eisenhower Matrix? 5. Explain why are the activities classified as important and urgent, important but not urgent, not important but urgent, and not important and not urgent? Instructions: 1. Design a time management schedule using the Eisenhower Matrix. In the matrix, plot your projected daily activities like school work, household work, other chores etc. for the next 30 days. Place the matrix in 8.5” by 13” bond paper. The matrix must be colorful to distinguish the areas and sub areas (important, less important, urgent, less urgent / do, plan, delegate, and drop) 2. Activities that are to be plotted in the matrix shall not be less than ten (10) in each box. 3. Write a reflection paper…arrow_forwardQuestion 1) Scheduling If the following jobs are sequenced according to the FCFS rule Job Processing Time (days) Due Date A 8 12 B 6 15 C 11 17 D 5 10 E 3 8 What is the mean tardiness (in days) for all jobs? What is the mean completion time in days for all jobs? What is the maximum job tardiness (in days)arrow_forwardQuestion 1: the following table contains information concerning four jobs that are awaiting processing at a work center. Job Time Due Date Job A (Days) 15 (Days) 21 7 15 16 10 17 a. Sequence the jobs using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. ASsume the list is by order of arrival. b. For each of the methods in part a, determine (1) the average job flow time, (2) the average tardiness, and (3) the average number of jobs at the work center. c. Is one method superior to the others?arrow_forward
- Question3: Two processes are applied in the same order to the jobs coming to a workstation. The durations of both processes for the six jobs coming to the workstation are as seen in the table. In order to minimize the total time to be spent on the jobs, the order in which the jobs should be done will be determined by the "johnson" rule. Accordingly, in the table below, write the order in which the business should do the work, in order, with the first things to be done on the far left, and one action to be written in each blank.1-) When the jobs are done in this order, how many minutes will it take to complete all the jobs?2-)1. How many minutes of space will there be in total in the process and the 2nd process?arrow_forwardQuestion 1 Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be latearrow_forwardQUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.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,
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.