Advertisement
Published in:
2018 | OriginalPaper | Chapter
Constrained Job Rearrangements on a Single Machine
Authors : Arianna Alfieri, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
Published in: New Trends in Emerging Complex Real Life Problems
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
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.