A new polynomial-time algorithm for linear programming
Combinatorica
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Single-machine scheduling polyhedra with precedence constraints
Mathematics of Operations Research
Artificial Intelligence - Special issue on knowledge representation
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Flexibility in a knowledge-based system for solving dynamic resource-constrained scheduling problems
Flexibility in a knowledge-based system for solving dynamic resource-constrained scheduling problems
SIAM Journal on Computing
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
Annals of Mathematics and Artificial Intelligence
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Local Probing Applied to Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
Discrepancy-Based Additive Bounding Procedures
INFORMS Journal on Computing
Heuristic stability: A permutation disarray measure
Computers and Operations Research
A Modeling Layer for Constraint-Programming Libraries
INFORMS Journal on Computing
Airlift mission monitoring and dynamic rescheduling
Engineering Applications of Artificial Intelligence
A framework for constructing complete algorithms based on local search
AI Communications - Constraint Programming for Planning and Scheduling
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
A theoretic and practical framework for scheduling in a stochastic environment
Journal of Scheduling
Minimally intrusive negotiating agents for resource sharing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint-based approach for steelmaking: continuous casting rescheduling
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Hybrid algorithms in constraint programming
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Search spaces for min-perturbation repair
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraint-based methods for scheduling discretionary services
AI Communications
Complex university course timetabling
Journal of Scheduling
Solving production scheduling with earliness/tardiness penalties by constraint programming
Journal of Intelligent Manufacturing
A hybrid algorithm for a class of resource constrained scheduling problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Theory and Practice of Logic Programming - Prolog Systems
Minimal perturbation problem in course timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Multi-sprint planning and smooth replanning: An optimization model
Journal of Systems and Software
Hi-index | 0.00 |
This paperdescribes an algorithm designed to minimally reconfigure schedulesin response to a changing environment. External factors havecaused an existing schedule to become invalid, perhaps due tothe withdrawal of resources, or because of changes to the setof scheduled activities. The total shift in the start and endtimes of already scheduled activities should be kept to a minimum.This optimization requirement may be captured using a linearoptimization function over linear constraints. However, the disjunctivenature of the resource constraints impairs traditional mathematicalprogramming approaches. The unimodular probing algorithm interleavesconstraint programming and linear programming. The linear programmingsolver handles only a controlled subset of the problem constraints,to guarantee that the values returned are discrete. Using probebacktracking, a complete, repair-based method for search, thesevalues are simply integrated into constraint programming. Unimodularprobing is compared with alternatives on a set of dynamic schedulingbenchmarks, demonstrating its effectiveness.In the final discussion, we conjecture that analogous probebacktracking strategies may obtain performance improvements overconventional backtrack algorithms for a broad range of constraintsatisfaction and optimization problems.