Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add kishorkukreja/awesome-supply-chain --skill process-optimizationgit clone --depth 1 https://github.com/kishorkukreja/awesome-supply-chainWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/process-optimization)<a href="https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/process-optimization"><img src="https://agentmods.dev/badge/skills/kishorkukreja/awesome-supply-chain/process-optimization/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/kishorkukreja/awesome-supply-chain/process-optimization"><img src="https://agentmods.dev/badge/skills/kishorkukreja/awesome-supply-chain/process-optimization.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector pass
What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00096 | $0.07627 |
| Opus 5 | $0.00048 | $0.03814 |
| Sonnet 5 | $0.00019 | $0.01525 |
| Haiku 4.5 | $0.00010 | $0.00763 |
Grade A, and why
process-optimization scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 8d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 987 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Process Optimization
You are an expert in process optimization and industrial engineering. Your goal is to help organizations analyze, simulate, and optimize manufacturing and operational processes to improve throughput, reduce cycle times, eliminate bottlenecks, and maximize efficiency.
Initial Assessment
Before optimizing processes, understand:
-
Process Context
- What process needs optimization?
- Current process flow and steps?
- Known bottlenecks or constraints?
- Current performance metrics?
-
Process Characteristics
- Process type? (serial, parallel, job shop, assembly line)
- Cycle times and processing rates?
- Resource constraints (machines, labor, materials)?
- Variability and randomness in process?
-
Optimization Goals
- Increase throughput?
- Reduce cycle time or lead time?
- Improve resource utilization?
- Reduce WIP inventory?
-
Data Availability
- Historical process data available?
- Time studies conducted?
- Current state documented?
- Access to observe process?
Process Optimization Framework
Process Analysis Methodology
1. Define & Document
- Process mapping (flowcharts, VSM)
- Identify inputs, outputs, resources
- Document current state
2. Measure & Collect Data
- Time studies
- Cycle time measurements
- Resource utilization tracking
- Quality data collection
3. Analyze
- Bottleneck identification
- Statistical analysis
- Root cause analysis
- Capacity calculations
4. Simulate
- Discrete-event simulation
- What-if scenarios
- Capacity planning
- Validate improvements
5. Optimize
- Implement improvements
- Balance resources
- Optimize scheduling
- Reduce variability
6. Control & Monitor
- Performance tracking
- Continuous improvement
- SPC monitoring
Process Analysis & Bottleneck Identification
Throughput Analysis
import numpy as np
import pandas as pd
import matplotlib.pyplot as plt
class ProcessAnalyzer:
"""
Analyze process flow and identify bottlenecks
Calculate throughput, cycle times, and utilization
"""
def __init__(self, process_steps):
"""
process_steps: list of dicts with process information
Example:
{
'step': 'Cutting',
'capacity_per_hour': 100,
'processing_time_min': 0.6,
'setup_time_min': 30,
'reliability': 0.90
}
"""
self.steps = pd.DataFrame(process_steps)
def identify_bottleneck(self):
"""
Identify bottleneck process step
Bottleneck = step with lowest capacity
"""
# Adjust capacity for reliability
self.steps['effective_capacity'] = (
self.steps['capacity_per_hour'] * self.steps['reliability']
)
# Find bottleneck
bottleneck_idx = self.steps['effective_capacity'].idxmin()
bottleneck = self.steps.loc[bottleneck_idx]
# System throughput limited by bottleneck
system_throughput = bottleneck['effective_capacity']
# Calculate utilization of each step based on bottleneck
self.steps['utilization'] = (system_throughput / self.steps['effective_capacity']) * 100
return {
'bottleneck_step': bottleneck['step'],
'bottleneck_capacity': bottleneck['effective_capacity'],
'system_throughput': system_throughput,
'process_analysis': self.steps
}
def calculate_cycle_time(self):
"""
Calculate total cycle time (processing time through all steps)
Assumes serial process
"""
total_processing_time = self.steps['processing_time_min'].sum()
total_setup_time = self.steps['setup_time_min'].sum()
# Critical path (longest path)
critical_path_time = total_processing_time
return {
'total_processing_time_min': total_processing_time,
'total_processing_time_hours': total_processing_time / 60,
'total_setup_time_min': total_setup_time,
'critical_path_time': critical_path_time
}
def calculate_little_law(self, wip, throughput_per_hour):
"""
Little's Law: WIP = Throughput × Lead Time
or: Lead Time = WIP / Throughput
Parameters:
- wip: Work-in-Process inventory (units)
- throughput_per_hour: throughput rate (units/hour)
Returns lead time
"""
lead_time_hours = wip / throughput_per_hour
lead_time_days = lead_time_hours / 24
return {
'wip': wip,
'throughput_per_hour': throughput_per_hour,
'lead_time_hours': lead_time_hours,
'lead_time_days': lead_time_days
}
def what_if_analysis(self, step_name, new_capacity):
"""
What-if analysis: impact of changing capacity at one step
Parameters:
- step_name: name of step to modify
- new_capacity: new capacity value
Returns new system performance
"""
modified_steps = self.steps.copy()
modified_steps.loc[modified_steps['step'] == step_name, 'capacity_per_hour'] = new_capacity
# Recalculate effective capacity
modified_steps['effective_capacity'] = (
modified_steps['capacity_per_hour'] * modified_steps['reliability']
)
# New bottleneck
new_bottleneck_idx = modified_steps['effective_capacity'].idxmin()
new_bottleneck = modified_steps.loc[new_bottleneck_idx]
new_throughput = new_bottleneck['effective_capacity']
# Improvement
current_throughput = self.identify_bottleneck()['system_throughput']
improvement = ((new_throughput - current_throughput) / current_throughput) * 100
return {
'modified_step': step_name,
'original_capacity': self.steps.loc[self.steps['step'] == step_name, 'capacity_per_hour'].values[0],
'new_capacity': new_capacity,
'new_throughput': new_throughput,
'new_bottleneck': new_bottleneck['step'],
'improvement_pct': improvement
}
def plot_capacity_analysis(self):
"""Plot capacity analysis showing bottleneck"""
bottleneck_analysis = self.identify_bottleneck()
df = bottleneck_analysis['process_analysis']
fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(14, 5))
# Capacity bar chart
colors = ['red' if step == bottleneck_analysis['bottleneck_step'] else 'skyblue'
for step in df['step']]
ax1.bar(df['step'], df['effective_capacity'], color=colors, edgecolor='black', linewidth=1.5)
ax1.axhline(bottleneck_analysis['system_throughput'], color='red', linestyle='--',
linewidth=2, label='System Throughput')
ax1.set_xlabel('Process Step', fontsize=12, fontweight='bold')
ax1.set_ylabel('Capacity (units/hour)', fontsize=12, fontweight='bold')
ax1.set_title('Process Capacity Analysis\n(Red = Bottleneck)', fontsize=14, fontweight='bold')
ax1.legend()
ax1.tick_params(axis='x', rotation=45)
ax1.grid(True, alpha=0.3, axis='y')
# Utilization chart
ax2.bar(df['step'], df['utilization'], color='lightgreen', edgecolor='black', linewidth=1.5)
ax2.axhline(100, color='red', linestyle='--', linewidth=2, label='100% Utilization')
ax2.set_xlabel('Process Step', fontsize=12, fontweight='bold')
ax2.set_ylabel('Utilization (%)', fontsize=12, fontweight='bold')
ax2.set_title('Resource Utilization', fontsize=14, fontweight='bold')
ax2.set_ylim([0, 110])
ax2.legend()
ax2.tick_params(axis='x', rotation=45)
ax2.grid(True, alpha=0.3, axis='y')
plt.tight_layout()
return fig
# Example usage
process_steps = [
{'step': 'Receiving', 'capacity_per_hour': 120, 'processing_time_min': 0.5, 'setup_time_min': 0, 'reliability': 1.0},
{'step': 'Cutting', 'capacity_per_hour': 100, 'processing_time_min': 0.6, 'setup_time_min': 30, 'reliability': 0.90},
{'step': 'Welding', 'capacity_per_hour': 80, 'processing_time_min': 0.75, 'setup_time_min': 45, 'reliability': 0.85},
{'step': 'Assembly', 'capacity_per_hour': 90, 'processing_time_min': 0.67, 'setup_time_min': 20, 'reliability': 0.95},
{'step': 'Testing', 'capacity_per_hour': 110, 'processing_time_min': 0.55, 'setup_time_min': 10, 'reliability': 0.98},
{'step': 'Packaging', 'capacity_per_hour': 130, 'processing_time_min': 0.46, 'setup_time_min': 5, 'reliability': 0.99}
]
analyzer = ProcessAnalyzer(process_steps)
# Identify bottleneck
bottleneck = analyzer.identify_bottleneck()
print("Bottleneck Analysis:")
print(f" Bottleneck: {bottleneck['bottleneck_step']}")
print(f" Bottleneck Capacity: {bottleneck['bottleneck_capacity']:.1f} units/hour")
print(f" System Throughput: {bottleneck['system_throughput']:.1f} units/hour")
print("\nProcess Utilization:")
print(bottleneck['process_analysis'][['step', 'effective_capacity', 'utilization']])
# Cycle time
cycle_time = analyzer.calculate_cycle_time()
print(f"\nCycle Time Analysis:")
print(f" Total Processing Time: {cycle_time['total_processing_time_min']:.1f} minutes")
# Little's Law
littles = analyzer.calculate_little_law(wip=200, throughput_per_hour=bottleneck['system_throughput'])
print(f"\nLittle's Law (Lead Time Calculation):")
print(f" WIP: {littles['wip']} units")
print(f" Throughput: {littles['throughput_per_hour']:.1f} units/hour")
print(f" Lead Time: {littles['lead_time_hours']:.1f} hours ({littles['lead_time_days']:.2f} days)")
# What-if analysis
what_if = analyzer.what_if_analysis('Welding', new_capacity=120)
print(f"\nWhat-If Analysis: Increase Welding capacity to 120 units/hour")
print(f" New System Throughput: {what_if['new_throughput']:.1f} units/hour")
print(f" New Bottleneck: {what_if['new_bottleneck']}")
print(f" Improvement: {what_if['improvement_pct']:.1f}%")
# Plot
fig = analyzer.plot_capacity_analysis()
plt.show()
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 8d ago First seen · 987 lines · 96 tokens per session scan A 9058519b9dea
process-optimization is a skill published in the GitHub repository kishorkukreja/awesome-supply-chain (67 stars, last pushed 12d ago), licensed MIT. It adds 96 tokens to every session and 7,627 once invoked, about $0.0005 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-09-03.
Other skills, from other repositories
systematic-debugging
Use when encountering any bug, test failure, or unexpected behavior, before proposing fixes.
local-ai-agents
Build local-first AI agents that run entirely on a developer workstation with Microsoft Foundry Local and Qwen function-calling models. Covers Small Language Models (SLMs), the OpenAI-compatible local endpoint, sandboxed local tools, local RAG with Chroma, local MCP servers, hybrid cloud/local routing, and the…
next-cache-components-adoption
Turn on Cache Components in a Next.js app and resolve the blocking routes it surfaces. Use when the user wants to enable, adopt, or migrate to Cache Components, flip the cacheComponents flag, work through a flood of blocking-prerender / instant validation errors, run the cache-components-instant-false codemod, or…
insight-error-page
Write or audit an insight-kind error page for the Next.js dev overlay. Use when creating a new errors/ .mdx page, auditing an existing one, or checking that a page matches the framework fix cards. Covers page structure, title alignment, FixCard cards with Copy prompt button, code snippets, terminology verification…
next-cache-components-optimizer
Drive a Next.js route to instant navigation by setting up an agentic loop, under Cache Components / PPR, on initial load (hard navigation) and client-side navigation (soft navigation). Encode the goal as a failing @next/playwright instant() e2e and work it to green, one verified route at a time; the shipped test then…
next-partial-prefetching-adoption
Turn on Partial Prefetching in a Next.js app and work through the insights it surfaces. Use when the user wants to enable or adopt Partial Prefetching, flip the partialPrefetching flag, opt routes in with export const prefetch = 'partial', audit Link prefetch={true} behavior, preserve existing prefetched UI with…