Professional Documents
Culture Documents
Chap013.ppt Scheduling Operations
Chap013.ppt Scheduling Operations
Chap013.ppt Scheduling Operations
Chapter 13
McGraw-Hill/Irwin
Chapter 13 Outline
Batch Scheduling Gantt Charting Finite Capacity Scheduling Theory of Constraints Priority Dispatching Rules Infinite Capacity Loading Planning and Control Systems
13-2
Synonyms
Shop Floor Control Scheduling Operations Production Activity Control (PAC) Detailed Planning and Scheduling (DPS)
13-3
Batch Scheduling
Very complex scheduling environment Can be thought of as Network of Queues Customers spend most of their time waiting Closely related to MRP (See chapter 16)
13-4
queue
WS 1
wait
queue
WS 2
wait
move
move move
Gantt Charting
Developed by Henry Gantt in 1917 Related concepts:
Makespan total time to complete a set of jobs Machine utilization percent of make span time a machine (or person) is used.
13-8
13-9
Scheduling Example
In what sequence should the jobs be done?
Job 5 Process A Job 1 A C Job 2 Process C Job 4
Process B
Job 3
13-10
C appears to be the bottleneck. But! A is used for every job; C is not. Either one could determine makespan.
13-11
13-12
13-13
13-14
The bottleneck determines the capacity of the system. Implication: the operations manager should focus on the bottleneck to increase capacity and throughput (and make more money).
13-15
In front office services, the most common rule is first come, first served. Part of the sequencing responsibility
13-16
13-17
Move/Wait (4 hrs)
Day 2
B (3 hrs)
Move/Wait (4 hrs)
Move/Wait (4 hrs)
Day 2
13-19
Work center B
Work center C
Hours scheduled
6 5 4 3 2 1
Job 2
6 5 4 3 2 1
Job 1
1 2 3
6 5 4 3 2 1
Job 2 Job 1
1 2 3
Job 1
1
Job 1
2 3
Day
Day
Day
13-20
Summary
Batch Scheduling Gantt Charting Finite Capacity Scheduling Theory of Constraints Priority Dispatching Rules Infinite Capacity Loading Planning and Control Systems
13-22
13-23