What you’ll work on
- Matching problems
- Scheduling problems and critical path analysis
Start with the idea
Assignment problems match each person or machine to one task while minimising cost or maximising benefit. Check all constraints, not just the cheapest individual entries.
A project network records precedence. Forward passes find earliest times; backward passes find latest times. Zero-float activities lie on critical paths; reducing a non-critical duration may not shorten the project.
A worked example
Cost matrix for workers A, B on tasks 1, 2 is [[4, 7], [6, 3]]. Find minimum assignment.
- The other assignment costs 7+6=13
- choose 4+3.
Answer: A→1, B→2, total 7.
Try one question
Costs[[8, 3], [5, 9]]: find minimum assignment.
Show answer and explanation
A→2, B→1, total 8.
Compare 3+5 with 8+9.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.