Asked by Sandra Vappie on Apr 25, 2024
Verified
Use Johnson's rule to determine the optimal sequencing for the five jobs to be processed on two machines in a fixed order (Machine 1 before Machine 2). The processing times in days are given in the table below.
a. What is the optimal sequence?
b. What is the total makespan for this sequence?
c. What is the total idle time for Machine 2?.
Machine 1 Machine 2 A 32 B 48 C 83D17E94F55\begin{array} { | l | r | r | } \hline & \text { Machine 1 } & \text { Machine 2 } \\\hline \text { A } & 3 & 2 \\\hline \text { B } & 4 & 8 \\\hline \text { C } & 8 & 3 \\\hline \mathrm { D } & 1 & 7 \\\hline \mathrm { E } & 9 & 4 \\\hline \mathrm { F } & 5 & 5 \\\hline\end{array} A B C DEF Machine 1 348195 Machine 2 283745
Idle Time
Periods when resources, such as machinery or labor, are available but not in use due to lack of work, setup, or maintenance.
Johnson's Rule
A sequencing rule for minimizing the total processing time and setup time on two machines or processes.
Optimal Sequence
The best or most efficient order in which to perform a series of tasks or operations, usually determined based on criteria like minimizing time or maximizing output.
- Implement Johnson's rule to ascertain the most efficient job order for minimizing makespan within a two-machine environment.
- Measure the efficiency of distinct scheduling policies using metrics such as average flow time, work-in-process inventory, lateness, and makespan.
- Investigate the consequences of task division on minimizing the completion time in a production sequence.
Verified Answer
Job Machine 1 time Machine 1 end time Machine 2 time Machine 2 end time Machine 2 idle time D11781 B 459160 F 5105210 E 9194250 C 8273302 A 3302320 Makespan 32 Total 3\begin{array} { | l | r | r | r | r | r | } \hline \text { Job } & \begin{array} { c } \text { Machine 1 } \\\text { time }\end{array} & \begin{array} { c } \text { Machine 1 } \\\text { end time }\end{array} & \begin{array} { c } \text { Machine 2 } \\\text { time }\end{array} & \begin{array} { c } \text { Machine 2 } \\\text { end time }\end{array} & \begin{array} { c } \text { Machine 2 } \\\text { idle time }\end{array} \\\hline \mathrm { D } & 1 & 1 & 7 & 8 & 1 \\\hline \text { B } & 4 & 5 & 9 & 16 & 0\\\hline \text { F } & 5 & 10 & 5 & 21 & 0\\\hline \text { E } & 9 & 19 & 4 & 25 & 0\\\hline \text { C } & 8 & 27 & 3 & 30 & 2\\\hline \text { A } & 3 & 30 & 2 & 32 &0 \\\hline\\\hline \text { Makespan } & 32& & &\text { Total } &3 \\\hline\end{array} Job D B F E C A Makespan Machine 1 time 14598332 Machine 1 end time 1510192730 Machine 2 time 795432 Machine 2 end time 81621253032 Total Machine 2 idle time 1000203 (c) 3 Hours.
Learning Objectives
- Implement Johnson's rule to ascertain the most efficient job order for minimizing makespan within a two-machine environment.
- Measure the efficiency of distinct scheduling policies using metrics such as average flow time, work-in-process inventory, lateness, and makespan.
- Investigate the consequences of task division on minimizing the completion time in a production sequence.
Related questions
The President of a Consulting Firm Wants to Minimize the ...
A Firm That Specializes in Desktop Publishing for Local Charities ...
The Following Jobs Are Waiting to Be Processed at Your ...
At Morgan's Transformer Rebuilding, Five Jobs Are Ready Now for ...
Bob Dresser Operates a Major Appliance Warranty Service Centre A ...