Artificial intelligence and operations research: Challenges and opportunities in planning and scheduling

Knowledge Engineering Review

Volumn 15, Issue 1, 2000, Pages 1-10

  Gomes, Carla P ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; DECISION SUPPORT SYSTEMS; DECISION THEORY; OPERATIONS RESEARCH; SCHEDULING; STRATEGIC PLANNING;

BRANCH-AND-BOUND METHODS; COMBINING CONSTRAINT SATISFACTION (CSP); JACKSON PREEMPTIVE SCHEDULE ALGORITHMS;

KNOWLEDGE REPRESENTATION;

EID: 0034155462     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888900001090     Document Type: Article

References (58)

1. Achlioptas, D, Gomes, C, Kautz, H and Selman, B, 2000. "Generating satisfiable instances" Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00).
2. Alt, H, Guibas, L, Mehlhorn, K, Karp, R and Wigderson A, 1996. "A method for obtaining randomized algorithms with small tail probabilities" Algorithmica 16 543-547.
3. Balas, E, Ceria, S and Cornuejols, G, 1993. "A lift and project cutting plane algorithm for mixed 0-1 programs" Mathematical Programming 58 295-324.
4. Barnhart, C, Johnson, E, Nemhauser, G, Savelsbergh, M and Vance, P, 1994. "Branch-and-Price: Column generation for solving huge integer programs" In: J Birge and K Murty (eds.), Mathematical Programming. State of the Art, 186-207.
5. Barth, P, 1996. Logic based 0-1 Constraint Programming. Kluwer.
6. Beldiceanu, N and Contejean, E, 1994. "Introducing global constraints in CHIP" Mathl. Comput. Modelling 20(12) 97-123.
7. Carlier, J and Pinson, E, 1990. "A practical use of Jackson's preemptive schedule for solving the job shop problem" Annals of Operations Research 26 269-287.
8. Caseau, Y and Laburthe, F, 1997. "Solving various weighted matching problems with constraints" Principles and Practice of Constraint Programming 1330. Lecture Notes in Computer Science Springer-Verlag, 17-31.
9. Caseau, Y, Laburthe, F, Le Pape, C and Rottembourg, B, 2000. "Combining local and global search in a constraint programming environment" The Knowledge Engineering Review 15.
10. Clements, D, Crawford J, Joslin, D, Nemhauser, G, Puttlitz, M and Savelsbergh, M, 1997. "Heuristic optimization: a Hybrid AI/OR approach" Workshop of Constraint Programming Austria.
11. Dantzig, GB, 1991. "Linear programming" In: J Lenstra, R Kan, A Schrijver (eds.), History of Mathematical Programming, A collection of Reminiscences. CWI, Amsterdam, 19-31.
12. Dantzig, GB and Wolfe, P, 1960. "Decomposition principle for linear programs" Operations Research 8 101-111.
13. Dixon, H and Ginsberg, M, 2000. "Combining satisfiability techniques from AI and OR" The Knowledge Engineering Review 15(1).
14. Frost, D, Rish, I and Vila, L, 1997. "Summarizing CSP hardness with continuous probability distributions" Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97).
15. Gale, D, Kuhn H and Tucker, A, 1951. "Linear programming and the theory of games" Activity Analysis of Production and Allocation. Wiley, New York, 317-329.
16. Glover, F, 1989. "Tabu search-part I" ORSA Journal on Computing, 1(3) 190-206.
17. Gomes, CP, Kautz, H and Selman, B, 1998. "Boosting combinatorial search through randomization" Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98).
18. Gomes, CP and Selman, B, 1997. "Problem structure in the presence of perturbations" Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97) New Providence, RI, 221-226.
19. Gomes, CP and Selman, B, 1999. "Search strategies for hybrid search spaces" Proceedings of the Eleventh International Conference on Tools with Artificial Intelligence (ICTAI-99).
20. Gomes, CP, Selman, B, Crato, N and Kautz, H, 2000. "Heavy-tailed phenomena in satisfiability and constraint satisfaction problems" Journal of Automated Reasoning to appear.
21. Gomes, CP, Selman, B, McAloon, K and Tretkoff C, 1998. "Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems" Proc. AIPS-98.
22. Gomory, R, 1958. "An outline of algorithm for integer solutions to linear programs" Bulletin of the American Mathematical Society 64 275-278.
23. Gomory, R, 1963. "An algorithm for integer solutions to linear programs" In: R Graves and P Wolfe (eds.), Recent Advances in Mathematical Programming. McGraw-Hill, 260-302.
24. Holland, JH, 1992. Adaptation in natural and artificial systems. University of Michigan Press.
25. Hooker, J, 1992. "Generalized resolution for 0-1 linear inequalities" Annals of Mathematics and Artificial Intelligence 6 271-286.
26. Hoos, H, 1999. "On the run-time behaviour of stochastic local search algorithms for SAT" Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-99) 661-666.
27. Hooker, J, Ottosson, G, Thorsteinsson, E and Kim, H, 2000. "A scheme for unifying optimization and constraint satisfaction methods" The Knowledge Engineering Review 15(1).
28. Jeroslow, R, 1980. "A cutting plane game for facial disjunctive programs" SIAM J. Control and Optimization 18 264-280.
29. Kantorovich, V, 1939. "Mathematical methods in the organization of planning of production" Management Science 6 366-422 [English translation].
30. Karmarkar, N, 1984. "A new polynomial time algorithm for linear programming" Combinatorica 4 373-395.
31. Kautz, H and Walser, J, 2000. "Integer optimization models of AI planning problems" The Knowledge Engineering Review 15(1).
32. Khachian, V, 1979. "A polynomial time algorithm for linear programming" Math. Doklady 20 191-194. [English translation].
33. Kirkpatrick, S, Gelatt, CD and Vecchi, MP, 1983. "Optimization by simulated annealing" Science 220 671-680.
34. Kirkpatrick, S and Selman, B, 1994. "Critical behavior in the satisfiability of random boolean expressions" Science 264 1297-1301.
35. Klee, V and Minty, G, 1972. "How good is the simplex algorithm?" In: O Shisha (ed.), Inequalities-III. Academic Press, New York, 159-175.
36. Leconte, M, Couronne, P and Vergamini, D, 1996. "Column generation using cooperating constraint-based solvers" Manuscript.
37. Lin, S, 1965. "Computer solutions of the traveling salesman problem" BSTJ 44(10) 2245-2269.
38. Lin, S and Kernighan, BW, 1973. "An effective heuristic for the traveling-salesman problem" Oper. Res. 21 498-516.
39. Lovasz, L and Schrijver, A, 1991. "Cones of matrices and set functions and 0-1 optimizations" SIAM J. Control and Optimization 166-190.
40. Luby, M, Sinclair, A and Zuckerman, D, 1993. "Optimal speedup of Las Vegas algorithms" Information Process. Lett. 17 173-180.
41. McAloon, K, Tretkoff, C and Wetzel, G, 1997. "Sports league scheduling" Proceedings of Third Ilog International Users Meeting.
42. McAloon, K, Tretkoff, C and Wetzel, G, 1998. "Disjunctive programming and and cooperating solvers" In: D Woodruff (ed.), Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Kluwer, 75-96.
43. Minton, S, Johnston, M, Philips, AB and Laird, P, 1992. "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems" Artificial Intelligence 58 161-205.
44. Monasson, R, Zecchina, R, Kirkpatrick, S, Selman, B and Troyansky, L, 1996. "Determining computational complexity from characteristic 'phase transitions' " Nature 400(8).
45. Motwani, R and Raghavan, P, 1995. Randomized Algorithms. Cambridge University Press.
46. Nemhauser, G and Wolsey, L, 1988. Integer and Combinatorial Optimization. Wiley, New York.
47. Nemhauser, G and Trick, M, 1997. "Scheduling a major college basketball. conference" Georgia Tech., Technical Report.
48. Oddi, A and Smith, S, 1997. "Stochastic procedures for generating feasible schedules" Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97) New Providence, RI.
49. Puget, J-F and Leconte, M, 1995. "Beyond the Black Box: Constraints as objects" Proceedings of ILPS'95 MIT Press, 513-527.
50. Régin, JC, 1994. "A filtering algorithm for constraints of difference in CSPs" Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-94) Seattle, WA.
51. Régin, JC, 1996. "Generalized arc consistency for global cardinality constraint" Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96) Oregon.
52. Rodosek, R and Wallace, M, 1998. "One model and different solvers for hoist scheduling problems" in preparation.
53. Selman, B, Kautz, H and Cohen, B, 1994. "Noise strategies for improving local search" Proc. AAAI-94 Seattle, WA, 337-343.
54. Selman, B, Levesque, HJ and Mitchell, D, 1992. "A new method for solving hard satisfiability problems" Proc. AAAI-92 San Jose, CA, 440-446.
55. Smith, D, Frank, J and Jónsson, A, 2000. "Bridging the gap between planning and scheduling" The Knowledge Engineering Review 15(1).
56. Smith, D and Parra, E, 1993. "Transformational approach to transportation scheduling" Proceedings of the Eighth Knowledge-Based Software Engineering Conference Chicago, IL.
57. Vance, P, 1993. "Crew Scheduling, Cutting Stock, and Column Generation: Solving Huge Integer Programs" Georgia Tech., PhD Thesis.
58. Vossen, T, Ball, M, Lotem, A and Nau, D, 2000. "Applying integer programming techniques to AI planning" The Knowledge Engineering Review 15(1).