Operations 2

Ch. 16
SCHEDULING [email protected]

1
WHAT IS SCHEDULING?
Establishing the timing of the use of equipment, facilities and human activities in an
organization

Effective scheduling can yield:

Cost savings
Increases in productivity

Scheduling

Assignment Sequencing
 Hungarian method  Priority rules
 Johnson’s rule

2
HUNGARIAN METHOD
Method of assigning jobs by a one-for-one matching to identify the lowest cost solution

Steps of Hungarian method

1) Row reduction: subtract the smallest number in each row from every number in the row

2) Column reduction: subtract the smallest number in each column from every number in the column

3) Test whether an optimum assignment can be made

a. Determine the minimum number of lines needed to cross out all zeros

b. If the number of lines equals the number of rows, an optimum assignment is possible. Go to step 6

c. Else, go to step 4

3
4. If the number of lines is less than the number of rows, modify the table:
a. Subtract the smallest number from every uncovered number in the table

b. Add the smallest uncovered number to the numbers at intersections of cross-out lines

c. Numbers crossed out but not at intersections of cross-out lines carry over unchanged to the next table

5. Repeat steps 3 and 4 until an optimal table is obtained

6. Make the assignments

a. Begin with rows or columns with only one zero

b. Match items that have zeros, using only one match for each row and each column

c. Eliminate both the row and the column after the match

4
SUMMING UP THE STEPS
1) Row reduction
2) Column reduction
3) Determine the min no of lines needed to cross all the zeroes
4) Check that the no of lines is equal to the no of rows and columns
5) If the no of lines is less than the no of rows, subtract the smallest no from every
uncovered cell and add that number to the intersection
6) Repeat step 3 and 4
7) Make the assignment

5
SEQUENCING

Determine the order in which jobs at a work center will be processed

Priority rules
Simple heuristics used to select the order in which jobs will be processed

 FCFS – first come first serve

 SPT – shortest processing time
 EDD – earliest due date
 CR – critical ratio
 S/O – slack per operation
 RUSH – emergency

6
COMMON PERFORMANCE METRICS
Job flow time
• This is the amount of time it takes from when a job arrives until it is complete
• It includes not only processing time but also any time waiting to be processed
Job lateness/ tardiness

•This is the amount of time the job completion time is expected to exceed the date the job was due or
promised to a customer
Make span

•The total time needed to complete a group of jobs from the beginning of the first job to the completion
of the last job
Average no of jobs
•Jobs that are in a shop are considered to be WIP inventory
7
 Average flow time
𝑡𝑜𝑡𝑎𝑙 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒
𝑛𝑜 𝑜𝑓 𝑗𝑜𝑏𝑠
Average tardiness
𝑡𝑜𝑡𝑎𝑙𝑡𝑎𝑟𝑑𝑖𝑛𝑒𝑠𝑠
𝑛𝑜 𝑜𝑓 𝑗𝑜𝑏𝑠
Average no of jobs
𝑡𝑜𝑡𝑎𝑙 𝑓𝑙𝑜𝑤𝑡𝑖𝑚𝑒
𝑡𝑜𝑡𝑎𝑙𝑝𝑟𝑜𝑐𝑒𝑠𝑠𝑖𝑛𝑔𝑡𝑖𝑚𝑒(𝑚𝑎𝑘𝑒 𝑠𝑝𝑎𝑛)
8
TWO WORK CENTER SEQUENCING
Johnson’s Rule

 Technique for minimizing makespan for a group of jobs to be processed on two machines or at two work
centers.

 Minimizes total idle time

Johnson’s Rule Conditions

 Job time must be known and constant for each job at the work center
 Job times must be independent of sequence
 Jobs must follow same two-step sequence
 All jobs must be completed at the first work center before moving to second work
center

9
PROBLEM 1
A foreman has determined processing times at a work center for a set of jobs and now wants to
sequence them. Given the information; determine the processing sequence using (1) FCFS, (2) SPT, (3)
EDD, and (4) CR. For each sequence, compute the average job tardiness, the average flow time, and the
average number of jobs at the work center. The list is in FCFS order.
Job Job time (days) Due date Operations remaining
A 4.5 10 3
B 6.0 17 4
C 5.2 12 3
D 1.6 27 5
E 2.8 18 3
F 3.3 19 1

10
 Job Job time (days) Due date Operations remaining
1. FCFS
A 4.5 10 3
Order: A-B-C-D-E-F B 6.0 17 4
C 5.2 12 3
Flow time= processing time + D 1.6 27 5
waiting time E 2.8 18 3
F 3.3 19 1

Job Processing Flow time Due date Tardiness Average Flow time=
time
Average tardiness=
A 4.5 4.5 10 0
B 6.0 10.5 17 0 Average no of jobs=
C 5.2 15.7 12 3.7
Average flow time=
D 1.6 17.3 27 0
E 2.8 20.1 18 2.1
Average tardiness=
F 3.3 23.4 19 4.4
23.4 91.5 10.2 Average no of jobs=

11
 Job Job time (days) Due date Operations remaining
2. SPT
A 4.5 10 3
Order: D-E-F-A-C-B B 6.0 17 4
C 5.2 12 3
D 1.6 27 5
E 2.8 18 3
F 3.3 19 1

Job Processing Flow time Due date Tardiness Average Flow time=
time
Average tardiness=
D 1.6 1.6 27 0
E 2.8 4.4 18 0 Average no of jobs=
F 3.3 7.7 19 0
A 4.5 12.2 10 Average flow time=
2.2
C 5.2 17.4 12 5.4
Average tardiness=
B 6.0 23.4 17 6.4
23.4 66.7 14 Average no of jobs=

12
 Job Job time (days) Due date Operations remaining
3. EDD
A 4.5 10 3
Order: A-C-B-E-F-D B 6.0 17 4
C 5.2 12 3
D 1.6 27 5
E 2.8 18 3
F 3.3 19 1

Job Processing Flow time Due date Tardiness Average Flow time=
time
Average tardiness=
A 4.5 4.5 10 0
C 5.2 9.7 12 0 Average no of jobs=
B 6.0 15.7 17 0
E 2.8 18.5 18 Average flow time=
0.5
F 3.3 21.8 19 2.8
Average tardiness=
D 1.6 23.4 27 0
23.4 93.6 3.3 Average no of jobs=

13
TWO WORK CENTER SEQUENCING
Johnson’s Rule

 Technique for minimizing makespan for a group of jobs to be processed on two machines or at two work
centers.

 Minimizes total idle time

Johnson’s Rule Conditions

 Job time must be known and constant for each job at the work center
 Job times must be independent of sequence
 Jobs must follow same two-step sequence
 All jobs must be completed at the first work center before moving to second work
center

14
PROBLEM 2
A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. For the group
of jobs listed,
a. Find the sequence that will minimize total completion time.
b. Determine the amount of idle time for workstation B.
JOB TIME
A B C D E
Idle time =
18+(115-96)=37
Work station A 27 18 70 26 15
Work station B 45 33 30 24 10

A B A C D E B
Workstation A
B A C D E

0 18 45(18+27) 115(45+70) 141 156

Workstation B
B A C D E

0 18 51 96 115 145 169 15

179
PROBLEM 3
Clean and Shine Car Service has five cars waiting to be washed and waxed. The time required (in minutes) for each
activity is given next. In what order should the cars be processed through the facility? When will the batch of cars be
completed?
Car Wash Wax
1 5 0
2 7 2 Wash 5 1 4 3 2 Wax
3 10 5
4 8 6 Idle time = 3+(16-8)+(26-22)+(33-31)=17

5 3 5

Wash
5 1 4 3 2

0 3 8 16 26 33
Wax
5 4 3 2

0 3 8 16 22 26 31 33 3516