Some Concluding Remarks
- 77 Downloads
We have analyzed and developed constraint propagation based methods for solving scheduling problems that occur in flexible manufacturing. We have focussed on one important class of problems, namely the disjunctive scheduling problem (DSP) which models the resource allocation in a scheduling environment with scarce resource supply and which is a generalization of the classical and famous job shop scheduling problem (JSP) or open shop scheduling prob?lem (OSP). The DSP has an elegant modelling as a constraint optimization problem with disjunctive constraints which enables the deduction of powerful constraint propagation techniques.
Unable to display preview. Download preview PDF.