Week 7 Tutorial: Assign the hotpot
Assign #01–#09 and #20 across three drones, then two types; build an equal-counts, unequal-time counterexample.
7 April 2027
Open Week 7 in the Lab →Try your own change on this week's case.
Two-hour tutorial: preparation, coding and checks
This week’s task#
Model: #01–#09 and #20; A/B are L and D is H. Three drones, full trips, no shared charging or corridor reservations.
Before you start · 15 minutes#
Read W7. Explain why #20 cannot go to A even if A is idle, then predict whether equal task counts balance completion time.
Trace the example · 25 minutes#
Give the hotpot to a light drone and inspect the payload rejection. Restore the starting example before comparing efficiency.
Implement and compare · 55 minutes#
Complete myAssign: filter infeasible pairs, compare predicted completion and keep every order exactly once. Open the assignment board to try one migration and recompute both queues.
Use Open full Lab for editable inputs, strategy code, exports and the practice pack. The example on this page compares this week’s published cases; your local student runner must call the functions you complete.
Check and explain · 25 minutes#
Keep the fleet fixed when comparing equal counts and predicted completion. Record one feasibility row and one justified assignment decision.
What to keep: A2: feasibility matrix, initial assignment and a migration. Show the tutor your prediction, experiment and explanation for this week’s participation point; keep the record to develop your assignment.
Optional extension#
Change the same three drones to all H and compare. An all-L fleet is an intentionally infeasible case; changing fleet size is a separate comparison.
W7 · Check payload before assigning.
Can you balance the workload while respecting payload and range?
Two light drones and one heavy drone share ten orders. The 3.5 kg hotpot needs the heavy drone.
10/10 on time. Every order delivered and every drone returned with all checks passing.
Computed from this case · 13.37 ms · lab-1.0 · ten-orders
Which drone can carry each meal?
| Order | A · light | B · light | D · heavy | Assigned |
|---|---|---|---|---|
| #01 | ✓ 387 s | ✓ 387 s | ✓ 553 s | A |
| #02 | ✓ 375 s | ✓ 375 s | ✓ 535 s | B |
| #03 | ✓ 105 s | ✓ 105 s | ✓ 135 s | D |
| #04 | ✓ 507 s | ✓ 507 s | ✓ 735 s | A |
| #05 | ✓ 167 s | ✓ 167 s | ✓ 227 s | B |
| #06 | ✓ 275 s | ✓ 275 s | ✓ 387 s | D |
| #07 | ✓ 472 s | ✓ 472 s | ✓ 645 s | A |
| #08 | ✓ 425 s | ✓ 425 s | ✓ 609 s | B |
| #09 | ✓ 333 s | ✓ 333 s | ✓ 475 s | D |
| #20 | No | No | ✓ 761 s | D |
Hotpot #20 weighs 3.5 kg. Light drones carry at most 1.5 kg. Each time includes the complete trip.
Explore the evidence, replay or open full Lab
Open full Lab ↗ for editable inputs, strategy code and saved comparisons.
Inspect #20: its 3.5 kg payload exceeds the light drone limit of 1.5 kg.
Colour bands show ground elevation. The marked passage runs between two towers; its rule allows one drone at a time. Height shown at 3× scale.
Read the example above
Inspect #20: its 3.5 kg payload exceeds the light drone limit of 1.5 kg.
Mixed fleet; complete trips · No shared charging in this model · Corridor reservations not active
| Inspect | Order | Drone | Load start | Deliver | Return | Late (s) | Energy (J) |
|---|---|---|---|---|---|---|---|
| #01 | A | 82 | 358 | 529 | 0 | 52958 | |
| #02 | B | 576 | 846 | 1011 | 0 | 56083 | |
| #03 | D | 937 | 1087 | 1132 | 0 | 28963 | |
| #04 | A | 1264 | 1600 | 1831 | 0 | 76764 | |
| #05 | B | 1681 | 1847 | 1908 | 0 | 21712 | |
| #06 | D | 2193 | 2469 | 2640 | 0 | 94634 | |
| #07 | A | 2606 | 2937 | 3138 | 0 | 80443 | |
| #08 | B | 2879 | 3174 | 3364 | 0 | 63728 | |
| #09 | D | 3349 | 3669 | 3884 | 0 | 108597 | |
| #20 | D | 7758 | 8221 | 8579 | 0 | 194341 |
Play the recorded flight, or drag the time slider.
Time and shared resources
NowThe vertical line marks the current time; outlined intervals are active. Select an interval to jump to its start. Intervals include their start and exclude their end.
0 s 8639 s
Continue in the Lab →The same case, with every input open to change.
The spec
What you bring to the session. Written so a reader can tell whether it has been met without asking you.
- infeasible drone–order pairs are excluded before any efficiency comparison
- you can explain why one migration changes another drone's finish time
- your matrix shows #20 as feasible for H and infeasible for L
Teaching team
- Kofi Marchetti — tutor