How to Solve DILR Scheduling and Routing Sets in CAT
A DILR concept guide for the scheduling and routing set family (timetables, shifts, and delivery routes) that aspirants often misread as seating or data-interpretation sets. It teaches the timeline grid method in four steps, gives recognition cues to classify a set in 60 seconds, walks through three fully solved sets (shift slots, delivery order, and a weekly timetable), and lists three time-saving traps.
How to Solve DILR Scheduling and Routing Sets in CAT
You open a DILR set: five doctors, four time slots, a "before and after" clue, and an "immediately after" clue. Ten minutes later you have a half-shaded grid and no answer. The problem is rarely the logic. It is the tool. A position grid built for seating arrangements does not fit a problem that asks you to build a sequence in time. Scheduling DILR CAT sets, along with their routing cousins, are a separate family with their own recognition cues and their own solving frame.
This guide covers what scheduling and routing sets are, how to spot them in your first minute, the timeline grid method that cracks them, and three fully solved sets you can work through. Pair it with the CAT exam guide for the DILR section structure and the DILR data interpretation guide for the sets this family is most often confused with.
DILR scheduling sets assign entities to slots, days, or shifts; routing sets fix the order of stops. Both yield to a timeline grid: ordered dimension on one axis, entities on the other. Translate clues into blocks, gaps, and adjacencies; fill the most restrictive constraint first; propagate forced cells until one arrangement survives. Recognise the family by time and order words, and attempt the densely constrained ones first.
What scheduling and routing sets actually are
Recognition cues: spotting the family fast
The timeline grid method in 4 steps
Solved set 1: a shift scheduling problem
Solved set 2: a delivery routing problem
What Scheduling and Routing Sets Actually Are
Most of your DILR practice maps entities to fixed positions: who sits where, which box holds what, which team beat whom. Scheduling and routing sets ask a different question. They want an order in time or along a path. A scheduling set assigns people or tasks to slots, shifts, or days under ordering rules. A routing set fixes the sequence of stops on a route or the order of visits. The answer is a line, not a grid of attributes.
That shift in question type is the whole reason this family deserves its own method. When the set says one task is "immediately after" another, or a stop is "visited next", you are being handed adjacency and order information that a position grid handles clumsily. A timeline handles it cleanly, because time and route order are themselves one-dimensional.
Recognition Cues: Spotting the Family Fast
You should classify a set within the first 60 seconds of reading, before you commit ink. Scheduling and routing sets announce themselves through specific vocabulary. The table below maps the cue to the set type and the tool you reach for.
| Cue in the set | Likely family | First tool |
|---|---|---|
| Time slots, shifts, starts at, back-to-back | Scheduling (time) | Timeline grid by slot |
| Days of week, Monday to Friday, weekly roster | Scheduling (days) | Timeline grid by day |
| Route, stops, delivery order, visited next, leg | Routing | Ordered position line |
| Before, after, immediately after, gap of | Order constraints | Relative-order notation |
The distinction from data interpretation matters. If the set hands you a table of numbers and asks for totals or comparisons, it is interpretation, not scheduling. If it hands you ordering rules and asks you to build a valid sequence, it is scheduling and routing. Misreading the family is the single biggest time sink on these sets.
The Timeline Grid Method in 4 Steps
The method is the same whether the ordered dimension is time, days, or stop positions. You build one axis for that dimension and place entities on it as constraints force them. Work the steps in order and resist the urge to guess early.
Draw the ordered axis
Write the slots, days, or stop positions left to right. This is your spine. Every clue will eventually attach to a cell on it.
Translate each clue into a symbol
Before and after become an inequality; immediately after becomes an adjacency block; a fixed time anchors a cell directly. Convert words to notation so you stop re-reading the paragraph.
Place the most restrictive clue first
Start with anchored cells and adjacency blocks, because they have the fewest valid positions. Each placement removes options for the rest.
Propagate until one arrangement survives
Apply the remaining order rules. If two cases remain, carry both briefly; the questions usually eliminate one. Stop the moment the grid is fully forced.
Want timed DILR sets that drill scheduling and routing recognition until it is automatic?
Practise DILR SetsSolved Set 1: A Shift Scheduling Problem
A clinic assigns four doctors P, Q, R, and S to four one-hour slots: 9–10, 10–11, 11–12, and 12–1. Each doctor takes exactly one slot. Constraints:
- P is scheduled in an earlier slot than Q.
- R is not in the first or the last slot.
- S is in the slot immediately after Q.
Solve it. Clue 3 forces Q and S into adjacent slots, with S right after Q. Clue 1 says P is before Q, so Q cannot be in slot 1. Test the Q–S block in the two remaining adjacent pairs:
Answer: 9–10 P, 10–11 R, 11–12 Q, 12–1 S. The adjacency block plus the "not first or last" clue forced a single arrangement.
Solved Set 2: A Delivery Routing Problem
A delivery van leaves the depot and visits five stops V, W, X, Y, and Z, once each, in some order (positions 1 to 5). Constraints:
- V is visited before W.
- X is the third stop.
- Z is visited immediately before Y.
- W is not the last stop.
Solve it. Clue 2 fixes X at position 3. Clue 3 makes Z–Y an adjacency block that must fit the open positions 1, 2, 4, 5. The only adjacent open pairs are (1,2) and (4,5):
Answer: V, W, X, Z, Y. Anchoring X first and treating Z–Y as one block collapsed the route in two checks.
Solved Set 3: A Weekly Timetable Problem
A trainer runs one session per day from Monday to Friday, one each of Cardio, Strength, Yoga, HIIT, and Rest. Constraints:
- Cardio is on Monday.
- Yoga is on Wednesday.
- Rest is the day immediately after HIIT.
Solve it. Clues 1 and 2 anchor Monday and Wednesday. That leaves Strength, HIIT, and Rest for Tuesday, Thursday, and Friday. Clue 3 needs HIIT and Rest on consecutive days:
Answer: Mon Cardio, Tue Strength, Wed Yoga, Thu HIIT, Fri Rest. With two days anchored, one adjacency rule fixed the rest.
Across all three sets the winning move was identical: anchor fixed cells, treat every "immediately after" as one inseparable block, then test the block against the few open positions. If you train that reflex, scheduling and routing sets become some of the fastest points in DILR rather than the slowest.
3 Traps That Waste Time on These Sets
Strong reasoners still lose minutes on scheduling DILR CAT sets for predictable reasons. Each trap below has a fix you can rehearse before the exam.
Trap 1: Forcing a position grid onto an order problem
Drawing a full attribute grid for a pure sequence problem buries the adjacency clues in noise. The fix is recognition: if the answer is an order, use a single line, not a grid. Build the recognition habit on the games and tournaments and networks sets too, so you classify before you draw.
Trap 2: Ignoring the most restrictive clue
Starting with a loose "before and after" clue spawns many cases. Starting with an anchored time or an adjacency block keeps the case count near one. Always sort your clues by how few placements they allow, then work the tightest first.
Trap 3: Not deciding whether to attempt at all
A routing set with a sparse map and few anchors can branch into several cases and eat eight minutes. Read the constraint density in your first minute, then choose. The CAT score predictor can show how a smarter set-selection habit moves your DILR percentile across mocks.
Test yourself on the three solved sets without looking at the working. Can you classify each as scheduling-by-time, routing, or scheduling-by-day in under ten seconds? Can you name the single most restrictive clue in each? If yes, your recognition is ready; if not, that is where to drill before timed practice.
- Classify in 60 seconds: time slots, days, or route order each get a single timeline axis.
- Convert words to symbols: before/after to inequalities, immediately after to adjacency blocks.
- Anchor fixed cells first, then place adjacency blocks, then loose order clues.
- Treat every "immediately after" pair as one inseparable unit when testing positions.
- Carry at most two live cases; let the questions kill one rather than brute-forcing all.
- Decide attempt-or-skip on constraint density: dense sets collapse fast, sparse routes branch.
A scheduling set is not harder than a seating set. It just needs a line instead of a grid.
Make DILR Set Selection a System
Get a personalised DILR practice plan that drills scheduling and routing recognition, set-selection calls, and timed accuracy until they become automatic.
Build My DILR PlanWhat students ask
What are scheduling and routing sets in CAT DILR?
They are a DILR family where you build a valid sequence or timetable rather than map fixed positions. Scheduling sets assign entities to time slots, days, or shifts under ordering and gap constraints. Routing sets fix the order of stops along a path. Both reward a timeline grid: draw time or position on one axis, entities on the other, and fill in constraints until one arrangement survives.
How do I recognise a scheduling or routing DILR set quickly?
Look for time and order words. Time slots, shifts, days of the week, before, after, immediately after, starts at, and back-to-back signal a scheduling set. Route, stops, delivery order, visited next, and leg signal a routing set. If the question asks for an order or a timetable rather than a grid of attributes, reach for the timeline grid first.
What is the timeline grid method for DILR scheduling sets?
The timeline grid puts the ordered dimension (slots, days, or stop positions) on one axis and the entities on the other. Translate each clue into a block, a gap, or an adjacency: before and after fix relative order, immediately after forces adjacency, and fixed-time clues anchor a cell. Fill the most restrictive constraint first, propagate forced cells, and stop when one arrangement remains.
Are scheduling and routing sets common in CAT DILR?
They appear regularly and have grown more frequent as CAT DILR has moved toward reasoning-heavy sets. A typical slot carries one or two sets that are scheduling or routing problems behind a cover story: meeting calendars, machine job queues, flight legs, or delivery rounds. Recognising the family fast lets you pick the right tool instead of forcing a position grid.
Should I attempt scheduling and routing sets first in CAT DILR?
Attempt them when the constraints are dense and concrete, because tightly constrained scheduling sets often collapse to one arrangement in three or four steps. Skip a routing set if the map has many parallel paths and few anchoring clues, since those branch into several cases and burn time. Read the constraint count and the number of fixed anchors in your first minute, then decide.
Optima Learn Editorial Team
CAT preparation specialists publishing structured guides on Quant, VARC, DILR, and IIM admissions. We break down each DILR set family into recognition cues, solving frames, and worked examples calibrated to the 2026 exam. Explore more at our blog or join the CAT 2026 waitlist.
Solve real CAT DILR sets timed
Hand-picked LR puzzles and DI caselets with timer + solution breakdown.