Operations and Project Management: Principles and Formulas

Introduction to Operations Management

Key Operations Definitions

• Operation: Activities that create value by transforming inputs into outputs.
• Operations Management (OM): The planning, organizing, and supervising of business activities to make operations efficient.
• Input: Resources used in a process.
  • Examples: Labor, raw materials, machines/equipment, capital, information.
• Transformation Process: Activities that convert inputs into outputs.
  • Examples: Manufacturing, cooking, healthcare services.
• Output: The goods or services produced by a process.
  • Examples: Coffee, car, banking service, medical treatment.
• Productivity: A measure of efficiency.
  • Formula: Productivity = Output / Input
  • Higher productivity = more output with fewer inputs.
• Single-Factor Productivity (SFP): Productivity measured using one input.
  • Example: Labor productivity = Output / Labor
  • Capital productivity = Output / Capital cost
  • Machine productivity = Output / Machine Input
• Multi-Factor Productivity (MFP): Productivity measured using multiple inputs.
  • Formula: MFP = Output / (Labor + Materials + Overhead)
• Efficiency: Producing maximum output using minimum inputs.
  • Goal: Maximize output and minimize resource use.
• Lean Operations: A philosophy focused on eliminating waste and improving efficiency.
  • Key idea: Remove non-value-adding activities.
• Waste (Lean Concept): Any activity that does not add value for the customer.
  • Examples: Waiting, excess inventory, unnecessary movement.
• Just-In-Time (JIT): A production system where materials arrive exactly when needed, reducing inventory.
  • Goal: Minimize waste and inventory.
• Kanban: A visual signal system used to manage inventory and production.
• Kaizen: A philosophy of continuous improvement through small ongoing changes.
• Jidoka: Automation with human oversight, allowing machines to stop automatically when a problem occurs.
• Supply Chain: The network of organizations involved in producing and delivering a product to customers.
  • Example: Supplier → Manufacturer → Distributor → Retailer.
• Value: The benefit customers receive from a product or service relative to its cost.

Improving Operations Efficiency

1. Understand the operations
2. Measure efficiency (productivity)
3. Improve the process

Project Management Principles

Project Management Definitions

• Project: A temporary set of activities with a unique output.
  • Examples: Construction project, movie production, video game development, writing a book.
• Work Breakdown Structure (WBS): A hierarchical breakdown of a project into smaller tasks or activities.
  • Purpose: Organize and define all project work.
• Project Planning: The phase where project goals, resources, and tasks are defined before the project begins.
• Project Scheduling: The process of determining the start and finish times of project activities.
  • Purpose: Create the project timeline.
• Project Controlling: Monitoring project progress, resources, and costs and adjusting plans when necessary.
• Gantt Chart: A chart that displays project activities on a timeline.
  • Rows: Activities
  • Columns: Time periods
  • Purpose: Shows when tasks start and finish.
• Network Diagram: A diagram that shows the order and dependency relationships between project activities.
  • Nodes: Activities
  • Arrows: Sequence relationships.
• Immediate Predecessor: An activity that must be completed before another activity can begin.
• Start Node: A node added to the network diagram when multiple activities have no predecessors.
• End Node: A node added when multiple activities have no successors.
• Critical Path Method (CPM): A technique used to determine project completion time, critical activities, and the project schedule.
• Critical Path: The longest path of activities from the start to the end of the project network diagram that determines the minimum project completion time.
  • Properties: Determines project completion time and contains activities with zero slack.
• Critical Activity: An activity with zero slack. If delayed, the entire project will be delayed.
• Activity Duration: The time required to complete an activity.
• Earliest Start Time (ES): The earliest time an activity can begin assuming all predecessors finish as soon as possible.
• Earliest Finish Time (EF): The earliest time an activity can finish.
  • Formula: EF = ES + Activity Duration
• Latest Finish Time (LF): The latest time an activity can finish without delaying the project.
• Latest Start Time (LS): The latest time an activity can start without delaying the project.
  
  Formula: LS = LF − Activity Duration
• Slack (Idle Time): The amount of time an activity can be delayed without delaying the entire project.
  • Critical activity → Slack = 0
  • Formula: Slack = LS − ES
  • Slack = LF − EF
• Forward Pass: A procedure used to calculate earliest start (ES) and earliest finish (EF) times by moving from the beginning of the network to the end.
• Backward Pass: A procedure used to calculate latest start (LS) and latest finish (LF) times by moving from the end of the network to the beginning.
• Project Crashing: Reducing the project completion time by shortening activity durations at the lowest possible cost.

Critical Path Method (CPM) Rules

Procedures used to calculate earliest and latest activity times to determine the project schedule.

Forward Pass

A procedure used to calculate earliest start (ES) and earliest finish (EF) times by moving from the beginning of the network to the end.

• Rule 1: For the first activity with no predecessors: ES = 0
• Rule 2: Calculate earliest finish time.
  Formula: EF = ES + Activity Duration

• Rule 3: If an activity has predecessors.
  Formula: ES = max(EF of all predecessors)

Backward Pass

A procedure used to calculate latest start (LS) and latest finish (LF) times by moving from the end of the network to the beginning.

• Rule 4: For the final activity with no successors: LF = Project Completion Time
• Rule 5: Calculate latest start time.
  Formula: LS = LF − Activity Duration
• Rule 6: If an activity has successors.
  Formula: LF = min(LS of all successors)

Slack Calculation

The amount of time an activity can be delayed without delaying the entire project.

• Formula: Slack = LS − ES
• Slack = LF − EF

Critical Activity

An activity with zero slack.

Critical Path Observations

Key properties of the critical path in a project network.

• Observation 1: The sum of the durations of activities on the critical path equals the project completion time.
• Observation 2: If any activity on the critical path is delayed, the entire project will be delayed.
  
• Observation 3: The critical path is the longest path in the project network diagram.
• Observation 4: A project may have more than one critical path.

Process Analysis and Capacity

Process Analysis Concepts

• Capacity: The maximum number of units a process can produce in a given period of time.
  • Formula: Capacity = 1 / Process Time
  • Example Question: A cashier takes 5 minutes per customer. What is the cashier’s capacity per hour?
    Process time = 5 minutes
    Capacity = 1 / 5 customers per minute
    Capacity = 12 customers per hour
• Throughput Rate (Output Rate / Flow Rate): The actual rate at which units are produced by the process.
  • Rule: Throughput Rate = min(Input Rate, Capacity)
  • Example Question: A system has an input rate of 15 customers/hour and a capacity of 20 customers/hour. What is the throughput rate?
    Throughput = min(15, 20)
    Throughput = 15 customers/hour
• Utilization: The percentage of time a workstation or resource is busy.
  • Formula: Utilization = Throughput Rate / Capacity
    or
    Utilization = Input Rate / Capacity
  • Example Question: A machine can process 20 units/hour and receives 15 units/hour. What is the utilization?
    Utilization = 15 / 20
    Utilization = 0.75 = 75%
• Process Time: The time required for a workstation to process one unit.
  • Formula: Process Time = 1 / Capacity
  • Example Question: A machine has a capacity of 30 units/hour. What is the process time per unit?
    Process time = 1 / 30 hour
    Process time = 2 minutes per unit
• Process Cycle Time: The time between two consecutive outputs when the process operates at full speed.
  • Rule: Process Cycle Time = Process Time of the Bottleneck
  • Example Question: A production line has three stations with process times:
    Station A = 20 sec
    Station B = 45 sec
    Station C = 30 sec
    Which station is the bottleneck and what is the cycle time?
    Bottleneck = Station B
    Cycle time = 45 seconds
• Bottleneck: The workstation with the longest process time or lowest capacity in a process.
  • Rule: Bottleneck determines the capacity of the entire process.
  • Example Question: Three stations have capacities:
    Station A = 40 units/hour
    Station B = 25 units/hour
    Station C = 35 units/hour
    Which station is the bottleneck and what is the process capacity?
    Bottleneck = Station B
    Process capacity = 25 units/hour
• Capacity of a Serial Process: The maximum output rate of a multi-station production line.
  • Rule: Capacity of Process = Capacity of Bottleneck
  • Example Question: Station capacities are:
    Station A = 30 units/hour
    Station B = 18 units/hour
    Station C = 25 units/hour
    What is the capacity of the process?
    Process capacity = 18 units/hour
• Throughput of a Process: The actual production rate of the system.
  • Rule: Throughput = min(Input Rate, Process Capacity)
  • Example Question: Input rate = 16 units/hour
    Process capacity = 18 units/hour
    What is the throughput?
    Throughput = 16 units/hour

• Process: Repetitive operations that convert inputs into outputs.
• Single-Stage Process: A process with one workstation or step.
• Multi-Stage Process: A process with multiple sequential workstations.
• Production Line (Serial Process): A process where units move through stations sequentially.
• Flowchart: A diagram used to describe the sequence of activities in a process.
• Time vs Rate:
  Process Time = time per unit
  Capacity = units per time
• Bottleneck Principle: The bottleneck limits the capacity of the entire process.

Understanding Bottlenecks

• Bottleneck: The workstation in a process that limits the overall capacity of the system. It is the station with the longest process time or the lowest capacity.
  • Rule: Bottleneck = station with the longest process time
    or
    Bottleneck = station with the lowest capacity
  • Example Question: A production line has three stations with the following processing times:
    Station A = 20 seconds
    Station B = 50 seconds
    Station C = 30 seconds
    Which station is the bottleneck?
    The longest process time is 50 seconds.
    Bottleneck = Station B
• Process Cycle Time: The time between two consecutive outputs when the process operates at full speed.
  • Rule: Process Cycle Time = Process Time of the Bottleneck
  • Example Question: Station A = 20 sec
    Station B = 45 sec
    Station C = 30 sec
    Which station determines the cycle time and what is the cycle time?
    Bottleneck = Station B
    Cycle time = 45 seconds

Waiting Line Management

Queueing Theory Definitions

• Queue (Waiting Line): A line of customers or units waiting to receive service in a system.
  • Rule: A queue forms when Arrival Rate > Service Rate
  • Example Question: Customers arrive at a bank at 10 customers/hour and the teller can serve 8 customers/hour. Will a queue form?
    Arrival Rate = 10
    Service Rate = 8
    Queue will form because 10 > 8
• Arrival Rate (λ): The average number of customers arriving to a system per unit of time.
  • Formula: λ = 1 / Average Interarrival Time
  • Example Question: Customers arrive every 5 minutes on average. What is the arrival rate?
    λ = 1 / 5 customers per minute
    λ = 12 customers per hour
• Service Rate (μ): The average number of customers that can be served per unit of time.
  • Formula: μ = 1 / Average Service Time
  • Example Question: A cashier takes 4 minutes per customer. What is the service rate?
    μ = 1 / 4 customers per minute
    μ = 15 customers per hour
• Utilization (ρ): The proportion of time the server is busy.
  • Formula: ρ = λ / (cμ)
    Where:
    λ = arrival rate
    μ = service rate
    c = number of servers
  • Example Question: Arrival rate = 10 customers/hour
    Service rate = 6 customers/hour
    Number of servers = 2
    ρ = 10 / (2 × 6)
    ρ = 10 / 12
    ρ = 0.83
• Little’s Law: A relationship between the average number of customers in the system, arrival rate, and average time in the system.
  • Formula: L = λW
    Where:
    L = average number of customers in system
    λ = arrival rate
    W = average time in system
  • Example Question: Arrival rate = 5 customers/hour
    Average time in system = 2 hours
    L = 5 × 2
    L = 10 customers
• Queue Discipline: The rule used to determine the order in which customers are served.
  • Examples: First-Come-First-Served (FCFS), Last-Come-First-Served (LCFS), Priority service
  • Example Question: A grocery store serves customers in the order they arrive. What queue discipline is used?
    Answer: FCFS
• Queue Components: The three main parts of a waiting line system.
  • Arrival Process – how customers arrive
  • Service Process – how customers are served
  • Queue Discipline – order of service
  • Example Question: Which of the following is NOT a component of a queueing system?

Managing Process Capacity

• Capacity of a Serial Process: The maximum output rate of a multi-station production line.
  • Rule: Capacity of Process = Capacity of Bottleneck
  • Example Question: Station capacities are:
    Station A = 40 units/hour
    Station B = 25 units/hour
    Station C = 35 units/hour
    What is the capacity of the system?
    The lowest capacity determines system capacity.
    Bottleneck = Station B
    Process capacity = 25 units/hour
• Improving Process Capacity: Increasing the output rate of the system.
  • Rule: To increase system capacity, improve the bottleneck station.
  • Example Question: A production line has three stations:
    Station A = 20 sec
    Station B = 50 sec
    Station C = 30 sec
    If Station A becomes faster, does system capacity increase?
    No. Station B is still the bottleneck, so the system capacity does not change.
• Key Bottleneck Principle: Improving non-bottleneck stations does not increase overall system capacity.
  • Rule: Only improving the bottleneck increases throughput.
  • Example Question: Station A = 25 sec
    Station B = 40 sec
    Station C = 30 sec
    If Station A improves to 15 sec, what happens to system capacity?
    Station B is still the bottleneck.
    System capacity remains determined by Station B.