Temporal Constraint Satisfaction Techniques in Job ShopScheduling Problem Solving

  • Authors:

  • Said Belhadji;Amar Isli

  • Affiliations:

  • LIPN, Institut Galilée, Université Paris-Nord, Avenue J.-B. Clément, F-93430 Villetaneuse, France;Division of Artificial Intelligence, School of Computer Studies, University of Leeds, Leeds LS2 9JT, United Kingdom

  • Venue:
  • Constraints
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a restriction of Dechter, Meiri and Pearl‘sTCSPs (Temporal Constraint Satisfaction Problems) sufficientlyexpressive to represent any job shop scheduling problem. A solverbased on the restriction is then described, which is similarto Ladkin and Reinefeld‘s qualitative interval network solver;except, however, that the filtering method used during the searchis not path consistency but either ULT (Upper-Lower Tightening)or LPC (Loose Path- Consistency), which are both less effectivebut have the advantage of getting rid of the so-called ’’fragmentationproblem‘‘.