Question

In: Statistics and Probability

Evan Schwartz has six jobs waiting to be processed through his machine. Processing time (in days)...

Evan Schwartz has six jobs waiting to be processed through his machine. Processing time (in days) and due date information for each job are as follows:

Job

Processing Time

Due Date

A

B

C

D

E

F

2

1

5

3

4

7

3

2

12

4

8

11

Sequence the jobs by FCFS, SPT, SLACK, and DDATE. Calculate the mean flow time and mean tardiness of the six jobs under each sequencing rule. Which rule would you recommend?

Solutions

Expert Solution

ANSWER

FCFS: Process the jobs in order of their arrival, A, B, C, D, E.

Job

Processing time

Flow time

Due date

Tardiness

a

2

2

3

0

b

1

3

2

1

c

4

7

12

0

d

3

10

4

6

e

4

14

8

6

f

5

19

11

8

55

21

Mean flow time = total flow time/ no. of jobs

                                   = 55/6 = 9.17

Mean Tardiness = total tardiness/ no. of jobs

                                = 21/6 = 3.50

SPT: Sequence the jobs by smallest processing time.

Job

Processing time

Flow time

Due date

Tardiness

b

1

1

2

0

a

2

3

3

0

d

3

6

4

2

c

4

10

12

0

e

4

14

8

6

f

5

19

11

8

53

16

Mean flow time = 53/6 = 8.83

Mean Tardiness = 16/6 = 2.67

SLACK: Sequence the jobs by minimum slack. The slack for each job is calculated as: (due date - today's date) - remaining processing time.

Job

Processing time

Due date

Slack

a

2

3

0

b

1

2

0

c

4

12

7

d

3

4

0

e

4

8

3

f

5

11

5

Job

Processing time

Flow time

Due date

Tardiness

a

2

2

3

0

b

1

3

2

1

d

3

6

4

2

e

4

10

8

2

f

5

15

11

4

c

4

19

12

7

55

16

Mean flow time = 55/6 = 9.17

Mean Tardiness = 16/6 = 2.67

DDATE: Sequence the jobs by earliest due date

Job

Processing time

Flow time

Due date

Tardiness

b

1

1

2

0

a

2

3

3

0

d

3

6

4

2

e

4

10

8

2

f

5

15

11

4

c

4

19

12

7

54

15

Mean flow time = 54/6 = 9

Mean Tardiness = 15/6 = 2.50

Process DDate method is recommended as it has the lowest Mean tardiness.

------------------------------------------------------------------------

DEAR STUDENT,..IF YOU HAVE ANY QUERY ASK ME IN THE COMMENT BOX,I AM HERE TO HELPS YOU.PLEASE GIVE ME POSITIVE RATINGS

*****************THANK YOU*****************


Related Solutions

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, which job should be scheduled first in the? sequence? job Alpha beta r 20 10 s 25 35 t 50 20 u 15 35 v 55 75
The following jobs are waiting to be processed at the same machine center. Jobs are logged...
The following jobs are waiting to be processed at the same machine center. Jobs are logged as they arrive: A 313 8 B 312 16 C 325 40 D 314 5 E 314 3 In what sequence would the jobs be ranked according to the following decision rules: (a) FCFS, (b) EDD, (c) SPT, and (d) LPT? Which decision is best and why? All dates are specified as manufacturing planning calendar days. Assume that all jobs arrive on day 275.
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 (days)...
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...
Six jobs are to be processed through a two-step operation. The first operation involves sanding, and...
Six jobs are to be processed through a two-step operation. The first operation involves sanding, and the second involves painting. Processing times are as following table. Job Operation 1 (Hours) Operation 2 (Hours) A 10 5 B 7 4 C 5 7 D 3 8 E 2 6 F 4 3 Determine the sequence that will minimize the total completion time for the jobs using Johnson’s rule. Illustrate graphically the throughput time and idle time at the two operations by...
Six jobs are to be processed through a? two-step operation. The first operation involves? sanding, and...
Six jobs are to be processed through a? two-step operation. The first operation involves? sanding, and the second involves painting. Processing times are as? follows: Job Operation 1 (hours) Operation 2 (hours) A 4 8 B 10 5 C 3 11 D 14 14 E 6 1 F 7 12 A) Using? Johnson's rule for? 2-machine scheduling, the sequence? is: b) For the schedule developed using? Johnson's rule, the total length of time taken to complete the six jobs? (including...
The following set of seven jobs is to be processed through two work centers at George?...
The following set of seven jobs is to be processed through two work centers at George? Heinrich's printing company. The sequence is first? printing, then binding. Processing time at each of the work centers is shown in the following? table: Job Printing (hours) Binding(hours) T 12 4 U 8 11 V 5 14 W 6 2 X 9 10 Y 3 1 Z 7 13 a-b) Using? Johnson's rule for? 2-machine scheduling, the sequence? is: Scheduled Order Job 1.____ 2....
Assume that you have a set of jobs where each has only a processing time that...
Assume that you have a set of jobs where each has only a processing time that you need to schedule on a single machine. Explain how you should schedule the jobs to minimize the sum of completion (finish) times. Write a proof that your schedule is optimal.
A batch production operation has a machine setup time of 4.0 hr and a processing time...
A batch production operation has a machine setup time of 4.0 hr and a processing time of 1.50 min per cycle. Three parts are produced each cycle. No tool handling time is included in the cycle. Part handling time each cycle is 30 sec. It consists of the worker obtaining three starting work units from a parts tray, loading them into the machine, and then after processing, unloading the completed units and placing them into the same tray. Each tray...
Job Remaining Processing time (days) Remaining time until due date (days) Critical ratio (?) A 20...
Job Remaining Processing time (days) Remaining time until due date (days) Critical ratio (?) A 20 30 B 30 50 C 10 25 D 16 80 E 18 12 Calculate for each job the relative critical ratio. Analyze the calculated critical ratio. Basing on the calculated CR, specify the scheduling order of each job. Justify your answer. Specify and explain a second dispatch rule that can be adopted.    Among the two rules which seems to be the most effective....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT