Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem

@article{Sadeh1995BacktrackingTF,
  title={Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem},
  author={Norman M. Sadeh and Katia P. Sycara and Yalin Xiong},
  journal={Artif. Intell.},
  year={1995},
  volume={76},
  pages={455-480}
}
This paper studies a version of the job shop scheduling problem in which sonie operations have to be scheduled within non-relaxable time windows (i.e earliest/latest possible start time windows). This problem is a well-known NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving this type of problems involves using depth-first backtrack search. In our earlier work, we focused on the development of consistency enforcing techniques and variable/value ordering heuristics… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems

John Doyle.
1989

Fox and Norman Sadeh and Can Baykan . Constrained Heuristic Search

E. C. Freuder.
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence • 1989

Variable and Value Ordering Heuristics for Activity - based Jobshop Scheduling

Norman Sadeh, Mark S. Fox.
Proceedings of the NASA Conference on Space Telerobotics • 1989

Similar Papers

Loading similar papers…