Abstract
We describe a restriction of Dechter, Meiri and Pearl‘s TCSPs (Temporal Constraint Satisfaction Problems) sufficiently expressive to represent any job shop scheduling problem. A solver based on the restriction is then described, which is similar to Ladkin and Reinefeld‘s qualitative interval network solver; except, however, that the filtering method used during the search is not path consistency but either ULT (Upper-Lower Tightening) or LPC (Loose Path- Consistency), which are both less effective but have the advantage of getting rid of the so-called ’’fragmentation problem‘‘.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
