For example, the nurse scheduling problem is concerned with scheduling a number of employees with typical constraints such as rotation of shifts, limits on overtime, etc. The travelling salesman problem is concerned with scheduling a series of journeys to minimize time or distance.
The nurse scheduling problem and the travelling salesman problem both address optimization issues in resource allocation with specific constraints. The nurse scheduling problem focuses on employee shift assignments, while the travelling salesman problem deals with route planning for minimizing travel time or distance.