Study guide

12.3 Creating Production and Service Schedules

APICS CPIM Certified in Planning and Inventory Management Exam

Track your progress as you read

Finished sections get a check mark.

1 Introduction & Exam Overview

1.1 Current Exam Facts 1.2 ECM 9.0 Domains and Weights 1.3 How to Study for CPIM

2 Supply Chain Strategy Foundations

2.1 Supply Chains, the Environment, and Strategy 2.2 Environment Analysis and Strategic Scope 2.3 Developing and Managing Organizational Strategy 2.4 Competitive Analysis: Five Forces, Benchmarking, and Value Chain

3 Strategy Performance and Operations Choices

3.1 Performance Monitoring and KPIs 3.2 Functional and Operational Strategies 3.3 Environments, Types, and Layouts 3.4 Service Process Design and Product-Process Trade-offs

4 Sales and Operations Planning

4.1 S&OP Purpose and Process 4.2 Aggregate Demand and Supply Plans 4.3 Reconciling S&OP Plans 4.4 Portfolio, New Product Introduction, and Life-Cycle Planning in S&OP 4.5 Strategic Buffers, Bottlenecks, and Capacity-Constrained Resources

5 Plan and Manage Demand

5.1 Demand Management 5.2 Sources of Demand and Forecasting 5.3 Forecast Performance 5.4 Marketing, Promotions, and Product Management 5.5 Qualitative, Associative, and AI-Driven Forecasting

6 Master Scheduling

6.1 Creating the Master Schedule 6.2 Rough-Cut Capacity Planning and MPS Validation 6.3 Using and Maintaining the Master Schedule 6.4 Planning Bills and Two-Level Master Scheduling 6.5 NPI, DFMA, Prototype, and End-of-Life Schedules

7 MRP, CRP, and Supply Disruptions

7.1 Material Requirements Planning 7.2 CRP, Order Promising, and Final Assembly Scheduling 7.3 Changes and Supply Disruptions 7.4 Product Costing and Variance Analysis for Planners

8 External Supply Sources

8.1 Suppliers and Procurement 8.2 Purchasing and Maintenance 8.3 Supply Chain Risk Management 8.4 Sourcing Footprint and Supplier Relationship Types 8.5 Supplier Release Mechanics and Inbound Logistics

9 Sustainability and Reverse Logistics

9.1 Sustainability Strategies 9.2 Waste Hierarchy and Reverse Logistics 9.3 Sustainability Standards, Reporting, and Life-Cycle Assessment

10 Inventory Planning and Costs

10.1 Inventory Planning 10.2 Inventory Costs, Accounting, Costing, and Metrics 10.3 EOQ, Reorder Point, and Safety Stock

11 Inventory Management and Control

11.1 Inventory Management Policies 11.2 Inventory Control 11.3 Service Levels and Inventory Tradeoffs 11.4 MRO Inventory and Maintenance Planning Inputs 11.5 Traceability Standards and Off-Site Inventory

12 Detailed Schedules and PAC

12.1 Planning Detailed Schedules 12.2 Scheduling and PAC Methods 12.3 Creating Production and Service Schedules 12.4 Managing Detailed Schedules and Scheduling Materials 12.5 Sequencing Rules, Lot Splitting, and Overlapped Scheduling 12.6 Capacity Types, Safety Capacity, and Labor Scheduling 12.7 Process Batches, Transfer Batches, and Backflushing

13 Plan and Manage Distribution

13.1 Planning Distribution 13.2 Replenishment and DRP 13.3 Order Management, Trace/Track, and KPIs

14 Quality and Business Investments

14.1 Quality Systems and Tools 14.2 Capital Equipment and Facilities 14.3 Technology in Planning and Inventory 14.4 The Seven Basic and Seven New Quality Tools 14.5 SPC Charts and Variation Types 14.6 Systems Requirements, Master Data, and Emerging Technologies

15 Continuous Improvement

15.1 Continuous Improvement Overview 15.2 Lean, JIT, and the Seven Wastes 15.3 Six Sigma, Kaizen, and Root Cause Tools 15.4 TPM, SMED, Standardized Work, and Visual Management

16 Integration and Exam Readiness

16.1 Planning Hierarchy Integration 16.2 High-Yield Calculations Drill 16.3 Exam Day, Scoring, and Credential Maintenance

12.3 Creating Production and Service Schedules

Key Takeaways Explain This Topic AI

Priority rules such as FCFS, SPT, EDD, and critical ratio (CR) produce different sequences and performance tradeoffs

SPT tends to minimize average flow time; EDD tends to protect due-date performance; CR adapts as time and work remaining change

Takt time sets the drumbeat of production to match demand rate: available time divided by demand quantity

Service appointment scheduling mirrors production priority and capacity logic—slots are finite resources with arrival and duration uncertainty

  • CPIM expects a small numeric comparison among priority rules, not memorization of slogans alone
  • Last updated: July 2026

Once loading philosophy and PAC methods are clear, schedulers must create the actual sequence of work. In production, that means ranking jobs at a resource. In services, that means assigning appointments, crews, or tickets to limited slots. CPIM treats both as detailed scheduling problems: finite capacity, competing due dates, and rules that trade one performance measure for another.

Priority Rules You Must Know

Common dispatching / priority rules include:

FCFS (First Come, First Served) — Process jobs in arrival order. Fair and simple; weak when a long job blocks many short ones.

SPT (Shortest Processing Time) — Run the shortest job next. Tends to minimize average flow time and average number of jobs in the system; may make long jobs very late.

EDD (Earliest Due Date) — Run the job with the nearest due date next. Tends to reduce maximum lateness and improve on-time performance; ignores processing length.

CR (Critical Ratio) — Priority index = (due date − today’s date) / remaining processing time (in the same time units). CR < 1 means the job is behind; lower CR is more urgent. CR updates as time passes and work completes.

Other rules (least slack, fewest operations remaining) appear in practice, but FCFS, SPT, EDD, and CR are the Domain VII core.

Worked Comparison: Four Jobs at One Work Center

Assume today is Day 0 . Four jobs are ready at a single machine. Processing times and due dates (in days) are:

  • Job Processing time (days) Due date (day) Arrival rank
  • A 4 12 1st
  • B 2 6 2nd
  • C 5 10 3rd
  • D 1 8 4th
  • FCFS sequence: A → B → C → D
  • Completion times: A=4, B=6, C=11, D=12
  • Lateness (completion − due, positive = late): A=0, B=0, C=1, D=4
  • Average flow time (completions, all ready at 0): (4+6+11+12)/4 = 8.25 days
  • Jobs late: C and D (2 late)
  • SPT sequence: D(1) → B(2) → A(4) → C(5)
  • Completions: D=1, B=3, A=7, C=12
  • Lateness: D=0, B=0, A=0, C=2
  • Average flow time: (1+3+7+12)/4 = 5.75 days
  • Jobs late: C only (1 late)
  • EDD sequence: B(due 6) → D(due 8) → C(due 10) → A(due 12)
  • Completions: B=2, D=3, C=8, A=12
  • Lateness: all ≤ 0 (none late)
  • Average flow time: (2+3+8+12)/4 = 6.25 days
  • Jobs late: 0

Critical ratio at Day 0 (CR = due / processing, since today = 0 and remaining time = full processing):

  • Job CR at Day 0 Urgency
  • A 12/4 = 3.00 Tied
  • B 6/2 = 3.00 Tied
  • C 10/5 = 2.00 More urgent
  • D 8/1 = 8.00 Least urgent

Lowest CR first: C (2.00) , then A and B tied at 3.00—break ties with a secondary rule (here EDD): B before A, then D. Sequence: C → B → A → D

  • Completions: C=5, B=7, A=11, D=12
  • Lateness: C=0, B=1, A=0, D=4
  • Average flow time: (5+7+11+12)/4 = 8.75 days
  • Jobs late: B and D (2 late)
  • What the numbers teach
  • Rule Sequence Avg flow time Jobs late
  • FCFS A-B-C-D 8.25 2
  • SPT D-B-A-C 5.75 1
  • EDD B-D-C-A 6.25 0
  • CR (Day 0) C-B-A-D 8.75 2

SPT won on average flow time. EDD won on due-date performance in this set. FCFS was “fair” but mediocre. Static CR at a single moment did not dominate—and CR must be recalculated as days pass. If the machine runs C first and we reach Day 5 with B, A, D still waiting, new CRs change priorities. Exam questions often ask which rule minimizes average flow time (SPT) or which best protects due dates in a simple set (often EDD).

Takt Time: Pacing Production to Demand

Takt time is the available production time divided by customer demand rate for a period:

Takt time = Available working time / Demand quantity

Example: A shift offers 450 productive minutes and demand is 150 units → takt = 450/150 = 3 minutes per unit . The line should complete a unit about every 3 minutes to match demand without overproducing. Cycle time of the bottleneck operation must be ≤ takt; if a station’s cycle is 3.5 minutes, the schedule cannot sustain demand without overtime, parallel resources, or demand leveling.

Takt is a design and pacing tool, not a priority rule. It shapes how many stations, how much WIP between stations, and whether the daily schedule is feasible. Mixed-model lines use takt with heijunka (leveling) so the sequence of models still averages to takt.

Service Appointment Scheduling Parallels

Service operations—clinics, field repair, consulting desks—face the same finite-capacity logic:

  • Slots are like machine hours; overbooking is infinite loading by another name
  • Arrival order versus shortest expected duration versus earliest promised time mirrors FCFS, SPT, and EDD
  • No-shows and variable service time create queue growth similar to scrap and run-time variance

Takt thinking appears as appointments per hour matched to demand (for example, 6 intake slots per hour if average service is 10 minutes and two clinicians work)

A field-service dispatcher who always sends the nearest technician (travel minimization) may ignore the earliest SLA due time—exactly the SPT-versus-EDD tradeoff. A clinic that books every open minute without recovery slots will see waiting rooms explode when one complex visit overruns—failure of finite loading and I/O-style control of arrivals.

Building the Schedule in Practice

Creating the schedule combines:

  • Demand or order pool for the horizon
  • Capacity calendar (machines, clinicians, crews)
  • Priority policy aligned to order winners
  • Setup or changeover logic (or appointment type grouping)
  • Takt or appointment-density check for feasibility
  • Publication of a dispatch list or appointment book, with freeze rules for the near horizon

Domain VII does not require you to run a full APS engine. It requires you to interpret small numeric examples, pick the rule that matches the stated goal, compute takt, and recognize that services use the same capacity math with different vocabulary.