The basis of the problem solved in this chapter is the job shop scheduling model. We use the job shop examples introduced in Scheduling with Unary Resources: the Job-Shop Problem, with two changes:
-
Rather than using unary resources, we use discrete resources with a capacity of 3.
-
Rather than having one instantiation of each job, the original problem (before the new jobs are incrementally added) has 3 instantiations of each job from the underlying job shop example. So, for example, the underlying jobshop problem corresponding to our smallest instance has 6 jobs each with 6 activities. The original multicapacity problem that we solve has 18 jobs each with 6 activities.
These variations make the problem instances larger and more interesting for searching for incremental solutions.