1. Scheduling Operations
Chapter 13
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
1

2. Outline
Batch Scheduling
Gantt Charting
Finite Capacity Scheduling
Theory of Constraints
Dispatching Rules
Infinite Capacity Loading
Planning and Control Systems
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
2

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)
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
3

4. Gantt Charting
Developed by Henry Gantt in 1917
Related concepts:
– Make span
– Machine utilization
Example
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
4

5. Finite Capacity Scheduling
Assumptions
Procedure
Example
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
5

6. Theory of Constraints (TOC)
The Goal (Goldratt)
New look at “Inventory”, “Throughput” and
“Operating Expenses”
Definition of “Theory of Constraints”
The concept of “bottleneck”
Implications of TOC for scheduling
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
6

7. Dispatching Rules
MINPRT (Minimum Processing Time)
MINSOP (Minimum Slack time per Operation)
FCFS (First Come, First Served)
MINSD (Minimum Planned Start Date)
MINDD (Minimum Due Date)
RANDOM (Random Selection)
MINPRT with Truncation
Critical Ratio
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
7

8. Planning and Control Systems
What delivery date do I promise?
How much capacity do I need?
When should I start on each particular
activity or task?
How do I make sure that the job is
completed on time?
Advanced Planning & Scheduling (APS)
Irwin/McGraw-Hill
© The McGraw-Hill Companies, Inc. 2004
8