Constraint and conflict directed search for the job-shop scheduling problem

Constraint and conflict directed search for the job-shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor1992594
Country: Canada
Volume: 30
Issue: 1
Start Page Number: 11
End Page Number: 29
Publication Date: Feb 1992
Journal: INFOR
Authors:
Keywords: artificial intelligence
Abstract:

This paper describes the OPIS job-shop scheduling system which is aimed at solving real-life problems via artificial intelligence and operations research techniques. The problem-solving strategy is based on an opportunistic constraint and conflict directed search and is realized through a black board-like architecture. Experimental results are presented at the end of the paper to illustrate the benefits of that approach.

Reviews

Required fields are marked *. Your email address will not be published.