EBK PRINCIPLES OF OPERATIONS MANAGEMENT
11th Edition
ISBN: 9780135175644
Author: Munson
Publisher: VST
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 20P
Summary Introduction
To determine: Theschedule that finishes sooner among first come first served and Johnson’s rule using Gantt chart.
Introduction: First come first served (FCFS) is the kind of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Q. 3
What is the total makespan from Question 1?
Question 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?
Answer was Job 4
Group of answer choices
a. 100
b. 130
c. 150
d. 170
e. 200
Question one:
Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are
representative, compare between FCFS and other scheduling rules should the radiology department be using and why
Processing Time
(Minutes)
Due Time (Minutes
from Now)
Patient
A
35
140
B
15
180
35
360
D
25
290
E
30
420
F
25
20
G
35
180
H
30
290
20
110
K
25
150
L
15
270
M
30
390
20
220
20
400
P
10
330
Q
10
80
R
15
230
20
370
QUESTION 5 (SCHEDULING: CYCLICAL SCHEDULING)
15.26 Daniel's Barber Shop at Newark Airport is open
7 days a week but has fluctuating demand. Daniel Ball is inter-
ested in treating his barbers as well as he can with steady work
and preferably 5 days of work with two consecutive days off.
His analysis of his staffing needs resulted in the following plan.
Schedule Daniel's staff with the minimum number of barbers.
DAY
MON. TUE. WED. THU. FRI. SAT. SUN.
6
5
5
5
6
4
3
Barbers
needed
Chapter 15 Solutions
EBK 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 one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 180 15 35 360 25 290 E 30 420 25 20 G 35 80 30 290 20 110 K 25 15 150 270 M 30 390 20 220 20 400 10 330 10 80 R 15 230 20 370 当 五犯 LEzlolalolclnarrow_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 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C Darrow_forward
- Question 4 Sunny Tailors has been asked to make three different types of wedding suits for separate customers. The table below highlights the time taken in hours for (1) cutting and sewing and (2) delivery of each of the suits. Suit 1 2 3 Cut and sew 4 7 6 Deliver 2 7 5 Determine a sequence that will minimize the total completion time for these jobs. Determine the efficiency of the sequences.arrow_forwardQUESTION 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_forwardQuestion 1 We assume that One end item needs 2 units L, 1 unit C and 3 units K. One unit L needs 2 units B and 3 units J. One unit C needs 2 units G and 2 units B. One unit K needs 4 units H and 2 units B. Two orders of 40 units and 60 units will be sent at the week 8 and 9. The manager knows that 15 units of B are scheduled to arrive at the beginning of week 4; 10 units of C are scheduled to arrive at the beginning of week 2. Only the component B should be ordered by lot and the lot size is 30. Use tables to make MRPS for end products and components. Item Lead time Amount on hand End item 1 L 2 C 3 K 3 B J G I G H 2|N 3 3 2 10 15 20 30 30 5arrow_forward
- Question atatchedarrow_forwardFinite capacity scheduling Question 20 options: schedules jobs through a number of work centers, each with one or more machines. All of these choices are correct. is an extension of the theory of constraints. requires that jobs are scheduled whole (cannot be split).arrow_forwardQuestion 5: The following figure shows the product structure tree of product A. A D (2) B (2) E (1) C (1) | D (3) The company requires 200 units of product A in period 8 and 150 units in period 6. The on hand inventory for products A, B, C, D and E are 50, 150, 40, 100, 70 respectively. The lead times for products A, B, C, D and E are 1, 0, 2, 1, 1. Develop the MRP and specify gross and net requirements, projected on-hand, planned order receipts, and planned order release for all the products. Assume we use lot-for-lot ordering for all the products and not safety stock is required.arrow_forward
- Question 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_forwardLast Question plsarrow_forwardQUESTION 4 (SCHEDULING: JOHNSON'S RULE) The following schedule was prepared by the production manager of Marymount Metal Shop: Determine a schedule that will result in the earliest completion of all jobs on this list. CUTTING POLISHING Job ABCDEFG (ii) (iii) (iv) Start 0 2 6 11 15 17 20 Finish 2 6 11 15 17 20 21 Start 2615232 11 20 24 Finish 5 9 13 20 23 24 28 What is the optimal sequence? Draw the time-phased chart. What is the total completion time? What is the total idle time at Polishing work centre?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 EducationOperations 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 LearningProduction 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.