Question

The scheduling rule that minimizes the makespan time for a set of jobs that must be...

The scheduling rule that minimizes the makespan time for a set of jobs that must be processed through a two-step system where every job follows the same sequence through the two processes is

A. the shortest processing time (SPT).

B. Johnson’s Rule.

C. the assignment method.

D. the minimal slack rule.

Business   Operations-Management   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Answer: Option (B) - Johnson’s Rule

Explanation: In operations management, there are scenarios where jobs have to be scheduled in two work centers. In order to ensure that the jobs are optimally sequenced such that it reduces the total time to complete all the jobs (known as the makespan time), Johnson’s Rule is used. The Johnson’s rule minimizes the makespan time for a set of jobs that must be processed through a two-step system where every job follows the same sequence through the two processes.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center...
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center has a relatively long backlog and sets a fresh schedule every 2? weeks, which does not disturb earlier schedules. Below are the jobs to be scheduled? today, which is day 241 ?(day 241 is a work? day). Job names refer to names of clients and contract numbers. Compute all times based on initiating work on day 241. (Job) (Date Job Received) (Due Date Duration...
Consider the problem of scheduling n jobs on a 3D printer. The turnaround time for a...
Consider the problem of scheduling n jobs on a 3D printer. The turnaround time for a job is the total time from when it arrives to when it finishes printing. Suppose that all jobs arrive at the same time and that we know the time that job i will take time tᵢ to print once started on the printer. Prove that scheduling the jobs in greedy order (i.e. shortest job first) minimizes the average turnaround time.
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center...
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center has a relatively long backlog and sets a fresh schedule every 2? weeks, which does not disturb earlier schedules. Below are the jobs to be scheduled? today, which is day 241 ?(day 241 is a work? day). Job names refer to names of clients and contract numbers. Compute all times based on initiating work on day 241. (Job) (Date Job Received) (Due Date Duration...
Part 3. Questions 3,4,5. [ Use Video-2 under Scheduling heading. ] [Note: The order of jobs...
Part 3. Questions 3,4,5. [ Use Video-2 under Scheduling heading. ] [Note: The order of jobs in a schedule ABCDE is 1st,2nd,3rd,4th,5th, respectively.] Five jobs arrived to be processed with the processing times and due dates. Present Date= 300 Work Order A B C D E Processing Times (Days) 14 5 40 12 7 Due Date 167 163 195 191 161 . . . Question 3. The FIFO schedule is “ABCDE” (where job “A” is the first job) and the...
Use Johnson's rule to determine the optimal sequencing for the five jobs to be processed on...
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 are given in the table below. Job Machine 1 Machine 2 L 10 2 M 5 4 N 7 5 O 3 6 P 1 7 ** Please show excel steps so i can see if I did this right** thanks What is the optimal sequence? What is the total...
Part 4.   Questions 6,7. [ Use Video-1 under Scheduling heading. ] [Note: The order of jobs...
Part 4.   Questions 6,7. [ Use Video-1 under Scheduling heading. ] [Note: The order of jobs in a schedule is 1st,2nd,3rd,4th,5th, for A,B,C,D,E, respectively.] The jobs A,B,C,D,E, arrived in that order to be processed on two machines. Job A B C D E Time on Machine 1 45 53 63 31 75 Time on Machine 2 42 65 61 53 77 Question 6. Which is the Johnson’s Rule schedule?      (A) ‘ACEBD’     (B) ‘DCABE’     (C) ‘DBECA’     (D) ‘DABEC’   (E) none...
Five jobs are waiting for processing through two work centers. Their processing time (in minutes) at...
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, a. what is the job processing sequence? b. how much idle time does work center Beta have? Job Alpha Beta R 20 10 S 25 35 T 50 20 U 15 35 V 55 75
*** ANSWER MUST RELATE TO LITTLE'S LAW AND THE TEXTBOOK (PERFORMANCE MODELING AND DESIGN OF COMPUTER...
*** ANSWER MUST RELATE TO LITTLE'S LAW AND THE TEXTBOOK (PERFORMANCE MODELING AND DESIGN OF COMPUTER SYSTEMS QUEING THEORY MOR HARCHOL BALTER) **** 6.7 More on SRPT The SRPT scheduling policy is important because it minimizes mean response time. In Exercise 2.3, we saw that SRPT does not minimize mean slowdown. Runting suggests that the problem with SRPT is that it picks jobs with the shortest remaining time, whereas to minimize mean slowdown we want to choose jobs that have...
What is the optimum job sequence for the jobs listed below using Johnson's Rule? Processing time(hrs)...
What is the optimum job sequence for the jobs listed below using Johnson's Rule? Processing time(hrs) Job Center 1 Center 2 d 13 23 e 23 14 f 16 18 g 20 17 A. e-g-f-d B. d-g-f-e C. d-f-g-e D. e-d-f-g E. f-e-d-g
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center...
The following jobs are waiting to be processed at Rick? Solano's machine center.? Solano's machine center has a relatively long backlog and sets a fresh schedule every 2? weeks, which does not disturb earlier schedules. Below are the jobs to be scheduled? today, which is day 241 ?(day 241 is a work? day). Job names refer to names of clients and contract numbers. Compute all times based on initiating work on day 241. (Job) (Date Job Received) (Due Date Duration...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT