ID (KPI identifier)

M

Effective Crane Count (ECC)

GRAMMAR

KPI name

M

Effective Crane Count

GRAMMAR

KPI type

M

Operational Performance

GRAMMAR

Applicable to

Berth, Terminal, Port, VesselVisit, Quay, Carrier

Also known as

O

TIC Description

Definition

M

Effective Crane Count (ECC) represents the number of cranes that could have done the job if all cranes operated at the productivity level of the busiest crane. Formula:

Open

TIC Description

Further Detail

O

Variants (optional)

• ECC.planned: derived from the pre-call plan.

• ECC.actual: derived from executed moves.

How to read it

• Higher ECC, for a fixed number of Deployed Cranes (DC), means there is more even sharing; expect ECC close to DC (DC = distinct deployed cranes with ≥1 counted move in the window).

• Lower ECC, also for a fixed DC, means one crane carried the load; others were starved, blocked, or off the critical path.

Indices (interpretation, not KPIs)

ECC lets us pull two simple, useful indices. One shows how evenly the cranes shared the work (Workshare Balance). The other shows how close we came to the maximum parallel work the stowage allowed on the critical path (Parallelism Realized).

• Workshare Balance (WB) = ECC.actual / DC

  Evenness across the cranes that actually worked.

• Parallelism Realized (PR) = ECC.actual / CD

  Portion of feasible critical-path parallelism used.

Relation to CTI and CD

• CTI: “On average, how many cranes were working?” (time deployment)

• ECC: “How evenly did they share the work?” (workshare balance)

• CD: “How many cranes could work on the critical path?” (feasible parallelism)

Bounds and guards

• ECC ≤ min(DC, CD).

Filter:

Carrier type: STS

Split:

Carriervisit: ID

Datapoints:

• ECC.planned:

  • Total vessel moves:
    tos|@|carriervisit|@|cycle|@|move|counter|#pomt#planned|box

  • Execution data (moves by crane)
    CHE|@|cycle|@|move|counter|#pomt#planned|box

• ECC.actual

  • Total vessel moves:

    tos|@|carriervisit|@|cycle|@|move|counter|#pomt#actual|box

  • Execution data (moves by crane)
    CHE|@|cycle|@|move|counter|#pomt#actual|box

Operator:

SUM(tos|@|carriervisit|@|cycle|@|move|counter|pomt|box) ÷ MAX of SUM per CHE unique ID(CHE|@|cycle|@|move|counter|pomt|box)

TIC Description

Required Information

M

Total vessel moves

Per-crane move counts (to identify the busiest crane)

TIC Description

SUBJECT

Terminal , Berth, STS,

CONCEPT

Available On 2023.009 Planning quality / critical path

Value

Cranes

Related standards

O

CALCULATION OF GMPH ORIENTED OPTIMUM STORAGE CAPACITY IN CONTAINER PORTS by Veysel SEKİN April 2022 DOI:10.13140/RG.2.2.16388.60806
Thesis for: Master Science ProgramAdvisor: Assıst. Prof. Dr. Hüseyin GENÇER

TIC Description

Related TIC 4.0 definition

O

https://tic40.atlassian.net/l/cp/ZpGsxYZa Cargo Operations TerminalOperations

TIC Description

Example

M

Examples - Calculating Effective Crane Count

Scenario A – Balanced Operation

Vessel data:

• Total vessel moves = 6,000

• Cranes deployed = 4

  Note: Deployed Cranes (DC) = 5 because QC-5 performed counted moves (100). “Deployed” = staffed concurrently; DC = cranes with ≥1 counted move in the ECC window.

Execution data (moves by crane):

(use counted moves; same inclusions as ECC/CD)

Busiest crane = QC-1 (1,550)

ECC = 6,000 ÷ 1,550 = 3.87

If CD = 4.00:

• Workshare Balance = ECC / DC = 3.87 / 5 = 0.77

• Parallelism Realized = ECC / CD = 3.87 / 4.00 = 0.97

Interpretation

• Four main cranes shared work evenly; a fifth did minimal work.

• Execution used ~97% of feasible critical path parallelism.

Scenario B – Unbalanced Operation

Vessel data:

• Total vessel moves = 6,000

• Cranes deployed = 4 (and DC = 4).

Execution data (moves by crane):

Busiest crane = QC-1 (2,800)

ECC = 6,000 ÷ 2,800 = 2.14

If CD = 4.00:

• Workshare Balance = 2.14 / 4 = 0.54

• Parallelism Realized = 2.14 / 4.00 = 0.54

Interpretation:

• One crane carried the load; others were starved/off-path.

• Only ~54% of feasible critical path parallelism realized.

Examples - Comparing CD and ECC

1. Match (good plan, good execution)

   • W (densest window): 1,520 of 6,000 → CD = 6,000/1,520 = 3.95

   • Busiest crane: 1,550 → ECC = 3.87 → PR = ECC/CD = 0.98

   • Read: Near the ceiling; strong balance and critical path use.

2. Under-realized (plan allowed more)

   • W: 1,500 of 6,000 → CD = 4.00

   • Busiest: 2,800 → ECC = 2.14 → PR = 0.54

   • Read: critical path potential left on the table (imbalance/interference/off-path work).

3. Geometric limit (only one fits)

   • W: 3,000 of 3,000 → CD = 1.00

   • All moves by one crane: ECC = 1.00 → PR = 1.00

   • Read: No critical path parallelism possible.

4. Fractional CD (do not round)

   • W: 2,250 of 7,200 → CD = 3.20

   • Busiest: 2,300 → ECC = 7,200/2,300 = 3.13 → PR = 0.98

   • Read: Slightly below the ceiling; fractional CDs are normal.

5. Spacing tightens (window grows), CD falls

   • Example: With tighter spacing the densest window increases, so CD drops.

   • Say CD = 1.76 (after spacing change), busiest = 4,200 of 7,200 → ECC = 1.71 → PR = 0.97

   • Read: Geometry reduces feasible critical path parallelism; execution stays near the new ceiling.

TIC Description

Example in the context of the grammar

M

Example from data points:

Scenario A – Balanced Operation

Filter:

Carrier type: STS

Split:

Carriervisit: ID

Data points

Vessel data:

• Total vessel moves = 6,000:
  tos|@|carriervisit|@|cycle|@|move|counter|value = 6000

Execution data (moves by crane):

• QC-1
  CHE|QC-1@|cycle|@|move|counter|box = 1550

• QC-2
  CHE|QC-2@|cycle|@|move|counter|box = 1450

• QC-3
  CHE|QC-3@|cycle|@|move|counter|box = 1500

• QC-4
  CHE|QC-4@|cycle|@|move|counter|box = 1400

• QC-5
  CHE|QC-5@|cycle|@|move|counter|box= 100

ECC = (tos|@|carriervisit|@|cycle|@|move|counter|value = 6000) ÷ (CHE|QC-1@|cycle|@|move|counter|box = 1550)

ECC = 3.87

Scenario B – Unbalanced Operation

Filter:

Carrier type: STS

Split:

Carriervisit: ID

Data points

Vessel data:

• tos|@|carriervisit|@|cycle|@|move|counter|value = 6000

Execution data (moves by crane):

• QC-1
  CHE|QC-1@|cycle|@|move|counter|box = 2800

• QC-2
  CHE|QC-2@|cycle|@|move|counter|box = 1200

• QC-3
  CHE|QC-3@|cycle|@|move|counter|box = 1000

• QC-4
  CHE|QC-4@|cycle|@|move|counter|box = 1000

ECC = (tos|@|carriervisit|@|cycle|@|move|counter|value = 6000) ÷ (CHE|QC-1@|cycle|@|move|counter|box = 2800)

ECC = 2.14

TIC Description

Search tags

M

#KPI, #Quay, #Berth, #Productivity, #Performance

Technical

Version / Date

M

20251104

Technical

Internal TIC Version

M

R0.1

Technical

Created by

Edited by

Review / Approve

Published

Nicolas Westgate