Chapters 22 & 22S — Interactive Review Q&A
A workcenter is any area where productive resources are organized and work gets done. It could be a machine, a desk, a service counter — any resource that processes jobs.
The goal of workcenter scheduling is to allocate jobs to resources, sequence them, dispatch (release) them, and monitor status — all while minimizing work-in-process (WIP) inventory.
FCFS feels "fair," but it often produces the worst average flow time and the most WIP. If a 2-minute job gets stuck behind a 45-minute job, everyone downstream waits.
This is why operations managers use priority rules — simple decision rules that use one or two pieces of information about the jobs to determine order.
| Rule | Logic | Best For |
|---|---|---|
| FCFS | Run jobs in arrival order | Service fairness (bank lines, DMV) |
| SOT / SPT | Shortest processing time first | Minimizing avg. flow time & WIP |
| EDD | Earliest due date first | Minimizing maximum lateness |
| STR | Smallest slack time remaining first | Urgency-aware scheduling |
| CR | Critical ratio (time left ÷ work left) | Dynamic, recalculated often |
| LCFS | Last come, first served | Happens by default (stack of papers) |
Research shows SOT is optimal for minimizing average flow time — but the best practical rules should be dynamic (recalculated frequently) and based on slack.
SOT constantly pushes long jobs to the back of the line. In a dynamic shop where new short jobs keep arriving, a big job can be indefinitely postponed.
A bank manager wouldn't use SOT either — customers can't tell in advance how long their transaction takes, and the perceived unfairness of cutting the line would be terrible for customer satisfaction.
When every job must pass through Machine A then Machine B (in that order), Johnson's Rule minimizes total completion time:
Step 1: Find the shortest processing time across both machines. Step 2: If it's on Machine A, schedule that job as early as possible. If it's on Machine B, schedule it as late as possible. Step 3: Remove that job and repeat.
The assignment method is a special case of linear programming used when you have n things to distribute to n destinations, each assigned to exactly one, using a single criterion (like cost or time).
Gantt charts give a visual timeline showing which jobs are on which machines, when they're scheduled to start/finish, and actual progress versus the plan. They work for both project management and shop-floor control because both involve scheduling multiple tasks across finite resources over time.
The difference from project Gantt charts: in shop-floor control, jobs usually aren't interdependent — their precedence is set by the scheduler's priority rules, not by task dependencies.
In manufacturing, you control the input rate. In services, customers arrive when they want and expect service immediately. You can't "hold" a rush of customers and smooth them out over the day.
Predictable demand patterns help (class schedules, lunch hours), but workers expect a minimum shift length once they arrive — so you often have excess capacity during slow periods.
Goldratt's key insight: in a perfectly balanced system, natural variability means any station that falls behind has no way to catch up. Small disruptions cascade, causing missed deadlines and growing WIP. The better strategy is to balance the flow of product, not the capacity of each station.
A bottleneck is any resource where capacity is less than the demand placed on it (utilization > 100%). A capacity-constrained resource (CCR) is close to demand but not quite over — it can become a bottleneck if not managed carefully.
The critical principle: an hour lost at a bottleneck is an hour lost for the entire system. An hour saved at a non-bottleneck saves nothing — it just creates idle time.
Drum = the bottleneck. It sets the pace (the "beat") for the entire system. Buffer = a safety stock of inventory placed just before the drum so it never starves. Rope = communication back upstream telling the first station to only release material at the rate the drum can process it.
Without DBR, upstream stations produce as fast as they can, WIP piles up before the bottleneck, and chaos follows.
1. IDENTIFY the system's constraint. 2. EXPLOIT it — squeeze every drop of capacity from it (no idle time, no bad parts). 3. SUBORDINATE everything else to that decision — non-bottlenecks serve the bottleneck's pace. 4. ELEVATE the constraint — invest to increase its capacity. 5. REPEAT — if the constraint has shifted, go back to step 1. Don't let inertia become the new constraint.
A process batch is the total number of units produced in one setup. A transfer batch is the portion of the process batch that moves to the next station without waiting for the whole batch to finish.
Making process batches too large is a common cause of moving bottlenecks — a non-bottleneck machine hogs time on a huge batch, starving downstream stations and temporarily acting like a bottleneck.
| Dimension | JIT | MRP | Synchronous Mfg. |
|---|---|---|---|
| Best environment | Continuous flow, make-to-stock | Job shop, custom shop | Job shop, custom shop |
| WIP levels | Very low | Very high | Low |
| Cycle time | Very short | Very long | Short |
| Schedule flexibility | Level production for 30+ days | Frozen ~30 days, variable in workcenters | Can change daily |
| Capacity awareness | Tries to balance | Starts OK, quickly inaccurate | Founded on capacity limits |
| Quality approach | Every station responsible | Inspect where cost justifies | Inspect before bottleneck + after |
| Scheduling direction | Pull (Kanban) | Backward (from due date) | Forward (from drum) |
5 quick questions covering both chapters. Click an answer to check yourself.
Q1 Which priority rule minimizes average flow time for a single machine?
Q2 In the Drum-Buffer-Rope system, what does the "rope" represent?
Q3 A non-bottleneck machine is scheduled with oversized batches. What's the most likely consequence?
Q4 Why is service scheduling (like staffing a campus café) fundamentally harder than manufacturing scheduling?
Q5 According to TOC, what should you do FIRST when you discover a system constraint?