Sequencing

Scheduling
Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering when question for activities
JAN
Build A A Done Build B B Done Build C C Done Build D Ship On time! 1
FEB
MAR
APR
MAY
JUN
High-Volume Systems
Flow system: High-volume system with Standardized
equipment and activities.
Assembly line balancing
Auto, computer industry
Flow-shop scheduling
Due to Repetition, scheduling is not a big issue
Project scheduling
Work Center #1
Work Center #2
Output
Scheduling Low-Volume Systems

Low volume systems
Minimal repetition Schedule from scratch every time
Loading - assignment of jobs to process centers Sequencing - determining the order in which jobs will be processed
Sequencing vs. Scheduling
3
Gantt Load Chart

Gantt chart - used as a visual aid for loading and scheduling
Resources into rows Time periods into columns
Work Mon. Tues. Wed. Thurs. Fri. Center 1 Job 3 Job 4 2 Job 3 Job 7 3 Job 1 Job 6 Job 7 4 Job 10
4
Loading
Infinite loading: unlimited capacity, like MRP Finite loading: consider capacity Schedule construction
Vertical loading
Load on 1 work center with different jobs at once
Horizontal loading
Load operations of 1 job to all work center at once
Forward scheduling
Too much wip
Backward scheduling
Risky
5
Priority Rules
FCFS SPT EDD
CR
- first come, first served - shortest processing time - earliest due date
S/O
- critical ratio =time remaining / processing time - slack per operation =slack remaining / # of operations remaining
Rush
- emergency
Performance measures
Flow time of a job: Duration of time from a job enters into the system until it leaves Lateness of a job: Amount by which completion date exceeds due date. Could be negative. Tardiness=max(lateness,0) Makespan: total time needed to finish a group of jobs Average number of jobs until the last is finished: =Total flow time / Makespan
8
Example: Sequencing rules

Jobs A B C D E Processing time 11 29 31 1 2 DD=Due date 61 45 31 33 32
Ex: FCFS
Jobs Proc.time Flow time DD Late Tardy
A
B C D E Total
11
29 31 1 2
11
40 71 72 74 268
61
45 31 33 32 202
-50
-5 40 39 42 66
0
0 40 39 42 121
Aver.
53.6
40.4
13.2
24.2
10
Ex: SPT to minimize the total flow time

D
E A B C Total
1
2 11 29 31
1
3 14 43 74 135
33
32 61 45 31 202
-32
-29 -47 -2 43 -67
0
0 0 0 43 43
Aver.
27.0
40.4 -13.4
8.6
11
Ex: EDD to minimize the maximum lateness

C
E D B A Total
31
2 1 29 11
31
33 34 63 74 235
31
32 33 45 61 202
0
1 1 18 13 33
0
1 1 18 13 33
Aver.
47.0
40.4
6.6
6.6
12
Example summary
Rule
FCFS
Average Flow Time (days)

53.6
Average Tardiness (days)

24.2
Average Number of Jobs at the Work Center

268/74=3.62
SPT
EDD
27
47
8.6
135/74=1.82
235/74=3.17
6.6
13
Two Work Center Sequencing Johnsons Rule: technique for minimizing

completion time for a group of jobs to be processed on two machines or at two work centers.
Minimizes total idle time and the makespan Several conditions must be satisfied
14
Johnsons Rule Conditions

Job time must be known and constant
Job times must be independent of sequence

Jobs must follow same two-step sequence Job priorities cannot be used
All units must be completed at the first work center before moving to the second
15
Johnsons rule 1. Select a job with the shortest processing time

If the processing time is on the first workcenter Schedule the job right after the already scheduled at the beginning of the list If the processing time is on the second workcenter Schedule the job right before the already scheduled at the end of the list
2. Cross out the scheduled job and go to 1
16
Example: Johnsons rule

Job Processing time on 1 Processing time on 2
A
B C D
15
8 12 20
25
6 4 18
17
The sequence that minimizes the makespan A-D-B-C
MC1 MC2
15
15
20
35
8
43
12
55
13 6
58 64
15
15
25
40
18
4
68
Idle time = 28
Makespan = 68
18
Sequence dependent set up times
Set up is basically changing the work center configuration from the existing to the new Set up depends on the existing configuration Set up time of an operation depends on previous operation done on the same work center Which sequence minimizes total set up time? There are too many sequences!
19
Scheduling Service Operations

Bottleneck operations Appointment systems
Controls customer arrivals for service
Consider patient scheduling
Reservation systems
Estimates demand for service
Scheduling the workforce

Manages capacity for service
Scheduling multiple resources

Coordinates use of more than one resource
20

Sequencing

Uploaded by

Copyright:

Available Formats

Sequencing

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sequencing

Uploaded by

Copyright:

Available Formats

Scheduling

Scheduling Low-Volume Systems

Gantt Load Chart

Example: Sequencing rules

Ex: SPT to minimize the total flow time

Ex: EDD to minimize the maximum lateness

Average Flow Time (days)

Average Tardiness (days)

Average Number of Jobs at the Work Center

Two Work Center Sequencing Johnsons Rule: technique for minimizing

Johnsons Rule Conditions

Job times must be independent of sequence

Johnsons rule 1. Select a job with the shortest processing time

2. Cross out the scheduled job and go to 1

Example: Johnsons rule

The sequence that minimizes the makespan A-D-B-C

Sequence dependent set up times

Scheduling Service Operations

Scheduling the workforce

Scheduling multiple resources

You might also like