The problem used in this chapter is once again the standard job shop scheduling problem, extended so that each activity requires one of a set of two resources rather than having a predefined resource requirement.