Here is a selection of publications that have resulted from research collaboration between OTS and CIRL:     

Generalizing Boolean Satisfiability I: Background and survey of existing work.

Generalizing Boolean Satisfiability II: Theory.

Generalizing Boolean Satisfiability III: Implementation.

Three papers by Heidi Dixon, Matthew Ginsberg, David Hofer, Eugene Luks, and Andrew Parkes. Appeared in JAIR in 2004 and 2005.

An effective algorithm for project scheduling with arbitrary temporal constraints.

An article by Tristan Smith and John Pyle describing the application of squeaky wheel optimization, enhanced with a new conflict-resolution approach, to resource-constrained project scheduling problems. Appeared in Proc. AAAI in 2004.

Combining Satisfiability techniques from AI and OR.

A paper by Heidi Dixon and Matthew Ginsberg. Appeared in The Knowledge Engineering Review in 2000.

Can Search Play A Role in Practical Applications?

 An article by Matthew Ginsberg, David Etherington and Brian Drabble describing the effectiveness of AI search-based techniques in solving a variety of large, complex, real-world problems. Appeared in Proceedings of AI Meets the Real World '98. Compressed postscript.

Squeaky Wheel Optimization.

An article by David Joslin and Dave Clements describing squeaky wheel optimization and how it was applied to two domains, including scheduling orders in a fiber optic cable assembly plant. Appeared in Proc. AAAI in 1998.

Heuristic Optimization: A Hybrid AI/OR Approach.

This article describes a combined AI and Operations Research (OR) effort on scheduling problems that produces better solutions than did AI or OR techniques on their own. This was joint work between CIRL and George Nemhauser, Markus Puttlitz, and Martin Savelsbergh at Georgia Tech. Presented at the Workshop on Industrial Constraint-Directed Scheduling, held in conjunction with CP-97 in 1997.

An Approach to Resource Constrained Project Scheduling

This paper by James Crawford gives an overview of an approach to Resource Constrained Project Scheduling (RCPS) problems. The approach is based on the combination of schedule packing (referred to as doubleback optimization in this paper) with LDS, and generated the best known solutions to benchmark problems of realistic size and character. It appeared in the 1996 Artificial Intelligence and Manufacturing Research Planning Workshop.

Limited Discrepancy Search

An article introducing limited discrepancy search, developed by Will Harvey and Matt Ginsberg. Appeared in Proc. IJCAI in 1995.

Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems

An article by Andrew Baker and James Crawford, reporting the results of running various solvers on a well known suite of scheduling problems. Appeared in Proc. AAAI in 1994.