The problem addressed in this chapter is also addressed in Tabu Search for the Jobshop Problem with Alternatives. It is a variation on the job shop scheduling problem using the problem instances MT06, MT10, and MT20 (see Scheduling with Unary Resources: the Job-Shop Problem). The difference is that instead of each activity requiring only one resource, each activity has a possibility of two alternative resources. Furthermore, the processing time of the activity depends on the resource to which it is assigned.
The objective is to assign each activity to a resource and schedule the activities on each resource so that the overall makespan is minimized.
PREVIOUS
NEXT