• Home
  • Search
  • Probe Backtrack Search for Minimal Perturbation in DynamicScheduling
  • Cite Icon150
  • https://doi.org/10.1023/a:1009856210543Copy DOI Icon

Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper describes an algorithm designed to minimally reconfigure schedules in response to a changing environment. External factors have caused an existing schedule to become invalid, perhaps due to the withdrawal of resources, or because of changes to the set of scheduled activities. The total shift in the start and end times of already scheduled activities should be kept to a minimum. This optimization requirement may be captured using a linear optimization function over linear constraints. However, the disjunctive nature of the resource constraints impairs traditional mathematical programming approaches. The unimodular probing algorithm interleaves constraint programming and linear programming. The linear programming solver handles only a controlled subset of the problem constraints, to guarantee that the values returned are discrete. Using probe backtracking, a complete, repair-based method for search, these values are simply integrated into constraint programming. Unimodular probing is compared with alternatives on a set of dynamic scheduling benchmarks, demonstrating its effectiveness. In the final discussion, we conjecture that analogous probe backtracking strategies may obtain performance improvements over conventional backtrack algorithms for a broad range of constraint satisfaction and optimization problems.

Similar Papers
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Research Article

Parametric Approach to Some Linearly Constrained Optimization Problems Using Simplex-Type Methods

  • May 01, 2006
  • Journal of The Chinese Institute of Industrial Engineers
  • Kuang-Yao Wu
  • Conference Article
  • Citations1

Constraint Solving and Optimization Using Evolutionary Techniques

  • Aug 01, 2019
  • Mahdi Bidar +1
  • Book Chapter
  • Citations2

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 01, 2016
  • Ricardo Soto +4
  • Research Article
  • Citations2

Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Feb 16, 2012
  • Journal of Mathematical Modelling and Algorithms
  • Marie-José Huguet +2
  • Research Article
  • Citations9

Global Constraints in Distributed Constraint Satisfaction and Optimization

  • Aug 30, 2013
  • The Computer Journal
  • C Bessiere +3
  • Research Article
  • Citations3

A learning Portfolio solver for optimizing the performance of constraint programming problems on multi‐core computing systems

  • Apr 27, 2016
  • Concurrency and Computation: Practice and Experience
  • Tarek Menouer +2
  • Conference Article
  • Citations1

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 07, 2001
  • M Tounsi +1
  • Conference Article
  • Citations8

Optimizing Constraint Solving via Dynamic Programming

  • Aug 01, 2019
  • Shu Lin +2
  • Research Article
  • Citations146

Compiling finite linear CSP into SAT

  • Dec 24, 2008
  • Constraints
  • Naoyuki Tamura +3
  • Book Chapter
  • Citations44

Compiling Finite Linear CSP into SAT

  • Jan 01, 2006
  • Naoyuki Tamura +3
  • Conference Article

Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search

  • Jun 01, 2016
  • Ricardo Soto +3
  • Book Chapter
  • Citations25

Portfolio Approaches for Constraint Optimization Problems

  • Jan 01, 2014
  • Roberto Amadini +2
  • Research Article
  • Citations2

Solving constraint satisfaction and optimization problems by a neuro-fuzzy approach

  • Jan 01, 1999
  • IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
  • S Cavalieri +1
  • Research Article
  • Citations26

Coordination of multiple agents for production management

  • Jan 01, 1997
  • Annals of Operations Research
  • Jyi-Shane Liu +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.