Constrained Job Rearrangements on a Single Machine
In several scheduling applications, one may be required to revise a pre-determined plan in order to meet a certain objective. This may happen if changes in the scenario predicted beforehand occur (e.g., due to disruptions, breakdowns, data values different from the expected ones). In this case costly reorganization of the current solution impose a limit on the allowed number of modifications. In our work, we address a single-machine scheduling problem where we need to alter a given (original) solution, by re-sequencing jobs with constraints on the number and type of allowed job shifts. For different objectives and rearrangement types, we propose mathematical programming models and possible solution approaches.
KeywordsScheduling Integer linear programming Re-sequencing Dynamic programming
- 4.Kumar, R., Vassilvitskii, S.: Generalized distances between rankings. In: Proceedings of the 19th International Conference on World Wide Web, pp. 571–580. ACM (2010)Google Scholar