Changeovers: A Sequence-Dependent Matrix, Plan Totals & Nearest Neighbour
This lesson is part of the course
In this lesson
You look up sequence-dependent changeover times from a from-to matrix with INDEX/MATCH, total two colour plans, find the nearest next colour with MINIFS and measure how much a light-to-dark order saves.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Job Data: Processing Times, Due Dates & Completion Times Locked
- FCFS, SPT & EDD: Three Sequences, Three Mean Flow Times Locked
- Lateness & Tardiness: Who Is Late, by How Much, and How Many Locked
- Critical Ratio: The Daily Dispatch List Locked
- Weighted Rules: WSPT and Weighted Tardiness Locked
- Johnson's Rule: Two Machines in Series, Makespan & Idle Time Locked
- Changeovers: A Sequence-Dependent Matrix, Plan Totals & Nearest Neighbour Locked
- Capstone: Rule Comparison Table & a Gantt Chart Locked