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.
Consider the nurse scheduling problem, which involves allocating shifts to nurses under conditions such as rotating shifts and controlling overtime hours. Similarly, the travelling salesman problem aims at devising routes that reduce travel times or distances.