Asked by Courtney Coffman on Apr 27, 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 hours 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 617 B 84 C 58 D 46 E 25\begin{array} { | l | r | r | } \hline & \text { Machine 1 } & \text { Machine 2 } \\\hline \text { A } & 6 & 17 \\\hline \text { B } & 8 & 4 \\\hline \text { C } & 5 & 8 \\\hline \text { D } & 4 & 6 \\\hline \text { E } & 2 & 5 \\\hline\end{array} A B C D E Machine 1 68542 Machine 2 174865
Johnson's Rule
A scheduling method used to minimize the total time required to complete a group of jobs on two machines or workstations.
Optimal Sequence
The most efficient order or arrangement of actions, steps, or items to achieve a desired outcome or objective.
Makespan
The total time needed to complete a set of tasks, from start to finish, under specific conditions.
- Utilize Johnson's rule to determine the best sequence of jobs to reduce the makespan in a system with two machines.
- Assess the effectiveness of various scheduling regulations in terms of average flow time, work-in-process quantities, lateness, and total completion time.
- Examine the effects of dividing tasks on shortening the total time taken in a manufacturing workflow.
Verified Answer
Job Machine 1 time Machine 1 end time Machine 2 time Machine 2 end time Machine 2 idle time E 22572 D 466130 C 5118210 A61717380 B 8254420 Makespan 42 Total 2\begin{array} { | c | r | r | r | r | r | } \hline \text { Job } & \text { Machine 1 time } & \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 \text { E } & 2 & 2 & 5 & 7 & 2 \\\hline \text { D } & 4 & 6 & 6 & 13 & 0 \\\hline \text { C } & 5 & 11 & 8 & 21 & 0 \\\hline \text { A} & 6 & 17 & 17 & 38 & 0 \\\hline \text { B }& 8 & 25 & 4 & 42 & 0 \\\hline\\\hline \text { Makespan } & 42& & & \text { Total }&2 \\\hline\end{array} Job E D C A B Makespan Machine 1 time 2456842 Machine 1 end time 26111725 Machine 2 time 568174 Machine 2 end time 713213842 Total Machine 2 idle time 200002 (c) 2 Days.
Learning Objectives
- Utilize Johnson's rule to determine the best sequence of jobs to reduce the makespan in a system with two machines.
- Assess the effectiveness of various scheduling regulations in terms of average flow time, work-in-process quantities, lateness, and total completion time.
- Examine the effects of dividing tasks on shortening the total time taken in a manufacturing workflow.
Related questions
The Following Jobs Are Waiting to Be Processed at Your ...
The President of a Consulting Firm Wants to Minimize the ...
At Morgan's Transformer Rebuilding, Five Jobs Are Ready Now for ...
Jack's Refrigeration Repair Is Under Contract to Repair, Recondition, And/or ...
Bob Dresser Operates a Major Appliance Warranty Service Centre A ...