Scheduling

Scheduling
n jobs 1 machine case
Priority rules
Comparative measures
Flow shop case
Scheduling -- determine the timing and order of operations to optimize the use of resources to
meet production requirements
n jobs 1 machine case
Priority rules (pg.590)
First Come First Serve (FCFS)
Shortest Processing Time (SPT)
Earliest Due Date (EDD)
Slack Time Remaining (STR) = time remaining before due date - remaining
processing time
The shortest STR goes first
Critical Ratio (CR) = Time remaining before due date/Remaining processing time
The smallest CR goes first
Comparison of priority rules
Average Completion time/Mean flow time =(Total processing time + total waiting
time)/Number of jobs
Average lateness = total late days/number of jobs
Example
Given:
Job

Processing Due Date

Slack time
time (days) (days hence) remaining

Critical
Ratio

20

30

10

1.5

30

50

20

1.7

10

25

15

2.5

16

80

64

5.0

18

60

42

3.3

FCFS

Proc.
Time

Flow
Time

Due
Date

Lateness

20

20

30

30

50

50

10

60

25

35

https://www.uky.edu/~dsianita/300/schedule.html

09-10-2015

Scheduling

16

76

80

18

94

60

34

Total

94

300

245

69

Mean

60

13.8

SPT

Proc.

Flow

Time to

Seq.

Time

Time

Due

Lateness

10

10

25

16

26

80

18

44

60

20

64

30

34

30

94

50

44

Total

94

238

245

78

Mean

47.6

15.6

SLACK

Proc.

Flow

Time to

Seq.

Time

Time

Due

Lateness

20

20

30

10

30

25

30

60

50

10

18

78

60

18

16

94

80

14

Total

94

282

245

47

Mean

56.4

9.4

CR

Proc.

Flow

Time to

Seq.

Time

Time

Due

Lateness

20

20

30

30

50

50

10

60

25

35

18

78

60

18

16

94

80

14

Total

94

302

245

67

Mean

60.4

13.4

EDD

Proc.

Flow

Time to

Seq.

Time

Time

Due

https://www.uky.edu/~dsianita/300/schedule.html

Lateness

09-10-2015

Scheduling

10

10

25

20

30

30

30

60

50

10

18

78

60

18

16

94

80

14

Total

94

272

245

42

Mean

54.4

8.4

Comparing the priority rules

Rule

Mean Flow Mean

Time
Lateness
60
13.8
**47.6
15.6
56.4
9.4
60.4
13.4
54.4
**8.4

FCFS
SPT
STR
CR
EDD
Exercises

Pg. 607 Problem 5, 13

Flow shop scheduling
n jobs two machines: all jobs require the same sequence/order in visiting the machines
Johnson's rule
If the shortest time is for the first machine, do the job first
If the shortest time is for the second machine, do the job last
Example

Job
A
B
C
D
E

Processing
Time, M1
5
3
8
10
7

Processing
Time, M2
2
6
4
7
12

Job sequence: B E D C A
Gantt Chart representation

https://www.uky.edu/~dsianita/300/schedule.html

09-10-2015

Scheduling

Exercises
Pg. 606 Problem 3, 9, 12, 14

https://www.uky.edu/~dsianita/300/schedule.html

09-10-2015