Concept explainers
A
Interpretation: Under the given scenario, the sequence that promises a minimized average lateness is to be derived.
Concept Introduction: The process of planning the ordering of the activities involves based on the elements such as, priority, set up time and such other is referred to as sequencing.
A
Explanation of Solution
Under the given order rule:
Job | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
Job | Processing Time | Flow Time | Due Date | Lateness | Tardiness |
1 | 7 | 7 | 21 | -14 | 0 |
2 | 3 | 10 | 7 | 3 | 3 |
3 | 5 | 15 | 8 | 7 | 7 |
4 | 2 | 17 | 5 | 12 | 12 |
5 | 6 | 23 | 17 | 6 | 6 |
6 | 9 | 32 | 16 | 16 | 16 |
7 | 14 | 46 | 38 | 8 | 8 |
8 | 4 | 50 | 12 | 38 | 38 |
Average | 25.00 | 9.50 | 11.25 |
Average Flow Time will be;
The average lateness will be;
The average tardiness will be;
Under the SPT rule:
Job | 4 | 2 | 8 | 3 | 5 | 1 | 6 | 7 |
Job | Processing Time | Flow Time | Due Date | Lateness | Tardiness |
4 | 2 | 2 | 5 | -3 | 0 |
2 | 3 | 5 | 7 | -2 | 0 |
8 | 4 | 9 | 12 | -3 | 0 |
3 | 5 | 14 | 8 | 6 | 6 |
5 | 6 | 20 | 17 | 3 | 3 |
1 | 7 | 27 | 21 | 6 | 6 |
6 | 9 | 36 | 16 | 20 | 20 |
7 | 14 | 50 | 38 | 12 | 12 |
Average | 20.38 | 4.88 | 5.88 |
Under the EDD rule:
Job | 4 | 2 | 3 | 8 | 6 | 5 | 1 | 7 |
Job | Processing Time | Flow Time | Due Date | Lateness | Tardiness |
4 | 2 | 2 | 5 | -3 | 0 |
2 | 3 | 5 | 7 | -2 | 0 |
3 | 5 | 10 | 8 | 2 | 2 |
8 | 4 | 14 | 12 | 2 | 2 |
6 | 9 | 23 | 16 | 7 | 7 |
5 | 6 | 29 | 17 | 12 | 12 |
1 | 7 | 36 | 21 | 15 | 15 |
7 | 14 | 50 | 38 | 12 | 12 |
Average | 21.13 | 5.63 | 6.25 |
The comparisons will be as follows:
AFT | AL | AT | |
FCFS | 25.00 | 9.50 | 11.25 |
SPT | 20.38 | 4.88 | 5.88 |
EDD | 21.13 | 5.63 | 6.25 |
Upon observing the above derived observations, it can be concluded that the sequence that minimizes the AL is EDD:
4 | 2 | 3 | 8 | 6 | 5 | 1 | 7 |
B
Interpretation: Under the given scenario, the sequence that promises a minimized average tardiness is to be calculated.
Concept Introduction: The process of planning the ordering of the activities involves based on the elements such as, priority, set up time and such other is referred to as sequencing.
B
Explanation of Solution
Upon observing the above derived observations, it can be concluded that the sequence that minimizes the AT is SPT:
4 | 2 | 8 | 3 | 5 | 1 | 6 | 7 |
C
Interpretation: In a generalized manner, the logic is to be placed into a procedure that aids in accomplishing these objects for most of the time.
Concept Introduction: The process of planning the ordering of the activities involves based on the elements such as, priority, set up time and such other is referred to as sequencing.
C
Explanation of Solution
The logic here is so simple. Supposing that the flow time need to be minimized then the SPT need to be implemented. The advantage of the SPT here is that it minimizes the average job flow time and WIP inventory and also thereby maximizes the resource allocation.
On the other hand, the EDD rule minimizes the average tardiness and lateness and in that it does the best job.
Once the data of processing time, the due date of the single machine are accomplished and the tardiness can easily be minimized, the firm does the best.
Want to see more full solutions like this?
Chapter 14 Solutions
OM (with OM Online, 1 term (6 months) Printed Access Card)
- Five jobs are waiting for processing through two work centers. Their processing time (in minutes) at each work center is contained in the table below. Each job requires work center Sigma before work center Delta. According to Johnson's rule, what sequence of jobs will minimize the completion time for all jobs? Job Sigma Delta R 20 10 S 25 30 T 30 20 U 35 35 V 15 25 Part 2 A. V−S−U−T−R B. V−R−U−S−T C. R−V−T−S−U D. S−U−T−V−R E. R−S−T−U−Varrow_forwardConsider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?arrow_forwardGiven the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardinessarrow_forward
- state whether or not each situation would be considered “compensable time” (and why or why not). An employee of a fast food chain has to arrive at work 15 minutes early to change into the“mascot” costume and it typically takes another 15 minutes at the end of the shift to change outof the costume and properly store it. Due to the cost of the costume, employees are notallowed to take the costume home. The “mascots” typically work from 10am – 2pm, to coverthe lunch rush periods. How much time would be “compensable” for the mascots, assumingthe conditions/schedule listed above?2) George is a Radiology Technician at a local hospital and when on call, is required to be nofurther than 30 minutes away from the facility. Is the “on call” time, compensable?arrow_forwardCurrently a company that designs Web sites has six customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 6 18 48 B 4 22 52 C 1 30 70 D 10 14 28 E 7 12 56 F 5 20 62 Develop a schedule by using the first-come, first-served (FCFS) rule and calculate the average flow time and average days past due for the schedule. Develop a schedule by using the earliest due date (EDD) rule and calculate the average flow time and average days past due for the schedule. Comment on the performance of the FCFS and EDD rules relative to average flow time and average days past due.arrow_forwardAt the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules. JOB DUE (IN HOURS) DURATION (HOURS REQUIRED) A 8 (this job is due in 8 hours) 1.65 B 5.5 (this job is due in 5.5 hours) 1.20 C 4.5 (this job is due after lunch in 4.5 hours) 0.85 D 6 (this job is due in 6…arrow_forward
- One possible solution method for the machine-to job assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal solution.arrow_forwardAn architect has five projects to complete. She estimates that three of the projects willrequire one week to complete and the other two will require three weeks and four weeks.During the time these projects are completed (and assuming no other projects areworked on during this time), what is the architect’s flow rate (projects per week)?arrow_forwardThe constraints governing the jobs are as fo1lows: A and B are start jobs; A controls C, D and E; B controls F and J; G depends upon C; H depends on D; E and F control I and L; K follows J; L is also controlled by K; G, H, I and L are the last jobs. Draw the network,arrow_forward
- Five jobs are waiting for processing through two work centers. Their processing time (in minutes) at each work center is contained in the table below. Each job requires work center Alpha before work center Beta. According to Johnson's rule, which job should be scheduled first in the sequence? O A. V OB. U O C. R OD. S O E. T Job R S T Alpha 20 23 50 26 55 Beta 34 35 20 26 75arrow_forward24 The job that arrived first at a work center or machine will be processed first and completed. Which of the following priority rules does this statement represent? a first come, first served b shortest processing time c critical ratio d earliest due datearrow_forwardConsider the following process at a pharmacy. Customers drop off their prescriptions either in the drive-through counter or in the front counter of the pharmacy. Customers can request that their prescription be filled immediately. In this case, they have to wait between 15 minutes and one hour depending on the current workload. Most customers are not willing to wait that long, so they opt to nominate a pickup time at a later point during the day. Generally, customers drop their prescriptions in the morning before going to work (or at lunchtime) and they come back to pick up the drugs after work, typically between 5pm and 6pm. When dropping their prescription, a technician asks the customer for the pick-up time and puts the prescription in a box labelled with the hour preceding the pick-up time. For example, if the customer asks to have the prescription be ready at 5pm, the technician will drop it in the box with the label 4pm (there is one box for each hour of the day). Every hour, one…arrow_forward
- 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.