Look-ahead techniques for micro-opportunistic job shop scheduling
Look-ahead techniques for micro-opportunistic job shop scheduling
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Amplification of Search Performance through Randomization of Heuristics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling
Heuristic-biased stochastic sampling
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Anytime heuristic search for partial satisfaction planning
Artificial Intelligence
Leap before you look: an effective strategy in an oversubscribed scheduling problem
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Effective approaches for partial satisfaction (over-subscription) planning
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Understanding algorithm performance on an oversubscribed scheduling application
Journal of Artificial Intelligence Research
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A constraint-based approach to scheduling an individual's activities
ACM Transactions on Intelligent Systems and Technology (TIST)
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Continuous management of airlift and tanker resources: A constraint-based approach
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time frame than available resource capacity will allow, and hence decisions must be made about which tasks should be included in the schedule and which should be excluded. We adopt a controlled, iterative repair search approach, and focus on improving the results of an initial priority-driven solution generation procedure. Central to our approach is a new retraction heuristic, termed max-flexibility, which is responsible for identifying which tasks to (temporarily) retract from the schedule for reassignment in an effort to incorporate additional tasks into the schedule. The max-flexibility heuristic chooses those tasks that have maximum flexibility for assignment within their feasible windows. We empirically evaluate the performance of max-flexibility using problem data and the basic scheduling procedure from a fielded airlift mission scheduling application. We show that it produces better improvement results than two contention-based retraction heuristics, including a variant of min-conflicts L Minton et al., 1992, with significantly less search and computational cost.