Question

HOW IS THE PRIORITY SCHEDULING DONE IN FOLLOWING QUESTION? GIVE DETAIL EXPLANATION OF ANSWERS. ALL STEPS INVOLVED.

The Ace Machine Company is considering using a priority scheduling rule in its fabrication shop and must decide whether to use: the critical rule, the order slack rule, the shortest operation next rule or the slack per operation rule.

 

The table below shows the company’s current inventory and shop status.

 

Exhibit 1

 

Order number

Manufacturing Lead Time

Remaining

Time   Remaining Until Due Date

Current Operation

Processing Time

Number   of Operations

Remaining

Total   Processing Time Remaining

1

15

7

2

3

8

2

15

11

3

4

8

3

20

-2

5

2

8

4

15

-5

4

3

8

5

15

3

1

12

8

Note: Time is measured in days. Manufacturing lead time remaining includes both the machine processing time and the length of time orders spend moving and waiting to be processed in a machine queue. Current operating processing time (as well as total processing time remaining) includes no move or queue times


Compute the scheduling priority index for each order in Exhibit 1 for the four sequencing rules

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Scheduling Scheduling means sequencing the work activities, allocate the resources for the operations, prioritize the activita) The formula for four sequencing rules Given: Order number 1 2 3 4 5 Manufacturing Time remaining lead time until due date2) Order slack Order slack is determined by subtracting processing time from the remaining due date. To determine the critica

b) Based on the Critical ratio resultant spreadsheet sort the values from lowest to highest Therefore, the CR sequence was deBased on the shortest operation next spreadsheet sort the values from the lowest to highest Therefore, the SON sequence was d

> I HAVE POSTED AN ANSWER TO THIS QUESTION. CAN YOU EXPLAIN THAT ANSWER? YOURS IS DIFFERENT THAN THAT.

Nimra Sajjad Mon, Nov 1, 2021 3:08 AM

Add a comment
Answer #2

Critical



Ratio

Job

Start

Days*

Done

Due

Order 4

-0.33

0

15

15

-5

Order 3

-0.1

15

20

35

-3

Order 5

0.2

35

15

50

2

Order 1

0.47

50

15

65

7

Order 2

0.73

65

15

80

11


Order Slack

Critical



Ratio

Job

Start

Days*

Done

Due

Order 3

-22

0

20

20

-3

 

Order   4

 

-20

 

20

 

15

 

35

 

-5

Order 5

-12

35

15

50

2

Order 1

-8

50

15

65

7

Order 2

-4

65

15

80

11


Shortest Operation Next


Critical



Ratio

Job

Start

Days*

Done

Due

Order 5

1

0

15

15

2

Order 1

2

15

15

30

7

Order 2

3

30

15

45

11

Order 4

4

45

15

60

-5

Order 3

5

60

20

80

-3



answered by: Nimra Sajjad
Add a comment
Know the answer?
Add Answer to:
HOW IS THE PRIORITY SCHEDULING DONE IN FOLLOWING QUESTION? GIVE DETAIL EXPLANATION OF ANSWERS. ALL STEPS INVOLVED.
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • please answer this ABC's machine shop is considering the use of priority scheduling rule in the...

    please answer this ABC's machine shop is considering the use of priority scheduling rule in the fabrication shop and must decide whether to use: a. Critical ratio (CR) Earliest due date (EDD) C. Shortest operation next (SON)/Shortest processing time 9SPT) d. Order Slack Order No. Total Remaining Time Remaining Current operation Manufacturing until Due Date Processing time Time (days) (days) (days) А 12 15 10 14 D 18 15 19 Using the four sequencing rules, compute the scheduling priority for...

  • Give the following scheduling algorithms : STRF, SJF, RR(q=6) Process Arrival Time Burst Time Priority P0...

    Give the following scheduling algorithms : STRF, SJF, RR(q=6) Process Arrival Time Burst Time Priority P0 2 15 3 P1 4 20 2 P2 0 28 1 P3 8 14 3

  • 3. [Challenging Question - Scheduling for Rescuing Scuba Divers (20 pts)] Tom Cruise has worked as...

    3. [Challenging Question - Scheduling for Rescuing Scuba Divers (20 pts)] Tom Cruise has worked as an operations manager of Underwater Treasure Discovery Company in Miami, FL and recently he was assigned to make a schedule to dispatch deep-water robots to save five scuba divers needing urgent rescue out of danger under the deep sea. He must do a very brief assessment of how urgent each diver appears and need to determine the best sequence to save all five scuba...

  • (a) Allan's job shop takes order for making spare parts for textile manufacturing equipment. The operation...

    (a) Allan's job shop takes order for making spare parts for textile manufacturing equipment. The operation milling and involves first milling and then finishing. Table Q4(a) presents the data of processing times for each job. (i) Determine the sequencing rule using First Come First Serve (FCFS) and Johnson's Rule. (4 marks) (ii) Make a work schedule on a Gantt chart using FCFS rules indicating the makespan. (6 marks) (iii) Make a work schedule on a Gantt chart using Johnson's rules...

  • 3. Consider the following seven-job problem. Each job must be processed by two ma chines A...

    3. Consider the following seven-job problem. Each job must be processed by two ma chines A and B, first on machine A and then machine B. The operation processing times at machine A and B are as follows: Job i 1 2 3 5 6 Processing time on machine A (a9 8 5 10 6 8 5 Processing time on machine B (b) 6 5 7912 11 4 a. Suppose jobs arrived in their natural order (i.e, job before job...

  • (d) Pre-emptive priority scheduling [4 marks]: Consider the following set of processes, with the length of...

    (d) Pre-emptive priority scheduling [4 marks]: Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst Priority Arrival Time P1 8 3 0 P2 3 4 1 P3 6 2 3 P4 3 1 5 P5 1 5 7 P6 3 8 14 P7 8 5 18 (d-1) Draw Gantt chart illustrating the execution of these processes using pre-emptive priority (a smaller priority number implies a higher priority) [2 marks] 00   01  ...

  • QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1...

    QUESTION 3 Consider the following set of processes: Priority Process Arrival Time A 0 B 1 C 6 * Lower number means higher priority Burst Time (ms) 5 3 4 Draw in a paper sheet 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Non-Preemptive SJF, Shortest-Remaining-Time-First (SRTF), Non-Preemptive Priority (NPP), and RR (quantum time = 2) scheduling algorithms, then fill the following tabic accordingly. (Note: If a new process arrives at the...

  • Operations Scheduling. You are a manager of an injection molding shop, and need to schedule several...

    Operations Scheduling. You are a manager of an injection molding shop, and need to schedule several jobs on your largest molding machine. You decide to restrict the order of your choices somewhat to take an advantage of subsequent processing that some jobs must undergo. There are six jobs to be scheduled on the molding machine. Job 1 should be done before job 4 and job 3 before job 5. Processing times, due dates (both in days) and the cost (as...

  • Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight...

    Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight processes below. Use any programming language. The program listing should be submitted with the report. FCFS (First Come First Serve) non-preemptive (partial results provided) SJF non-preemptive MLFQ Multilevel Feedback Queue (absolute priority in higher queues)             Queue 1 uses RR scheduling with Tq = 5             Queue 2 uses RR scheduling with Tq = 10             Queue 3 uses FCFS All processes enter first...

  • OS CPU Scheduling 1. Given the following processes Process Arrival Time 0 Priority 5 P1 P2...

    OS CPU Scheduling 1. Given the following processes Process Arrival Time 0 Priority 5 P1 P2 P3 P4 Burst Time 10 5 8 15 2 2 3 2 a) Please demonstrate the SJF and LJF algorithms on the above. (Note: if they mention SJF or any other, make sure u do both the non- preemptive and preemptive) b) What are the differences between them?

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT