A Job-Shop Scheduling Model of Software Development Planning for Constraint-Based Local Search
Software development planning usually does not take any advantage of planning and scheduling techniques involving reasoning about time and resources, which are typical in the manufacturing area. This paper proposes a constraint-based model for the Job Shop Scheduling Problem to be solved using local search techniques. The model can be used to represent a multiple software process planning problem when the different (activities of) projects compete for limited staff. The AllDifferent and Increasing constraints enforce the conjunction of one binary constraint, the not-equal constraint and the greater constraint respectively, for every pair of variables.