Adaptive problem-solving for large-scale scheduling problems: A case study

Journal of Artificial Intelligence Research

Volumn 4, Issue , 1996, Pages 365-396

  Gratch, Jonathan ^a   Chien, Steve ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SATELLITE COMMUNICATION SYSTEMS; SCHEDULING;

CENTRAL PROCESSING UNIT TIME; FLEXIBLE CONTROL ARCHITECTURE;

PROBLEM SOLVING;

EID: 0029679218     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.177     Document Type: Article

References (45)

1. Baker, A. (1994). The Hazards of Fancy Backtracking. In Proceedings AAA194.
2. Bell, C., & Gratch, J. (1993). Use of Lagrangian Relaxation and Machine Learning Techniques to Schedule Deep Space Network Data Transmissions. In Proceedings of The 36th Joint National Meeting of the Operations Research Society of America, the Institute of Management Sciences.
3. Biefeld, E., & Cooper, L. (1991). Bottleneck Identification Using Process Chronologies. In Proceedings IJCAI-91.
4. Chien, S. & Gratch, J. (1994). Producing Satisficing Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems.
5. Chien, S., Gratch, J. & Burl, M. (1995). On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach. Institute of Electrical and Electronics Engineers Transactions on Pattern Analysis and Machine Intelligence 17(7), 652-665.
6. Dechter, R. & Pearl, J. (1987). Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence 34(1) 1-38.
7. Dechter, R. (1992). Constraint Networks. In Encyclopedia of Artificial Intelligence, Stuart C. Shapiro (ed.).
8. Etzioni, E. (1990). Why Prodigy/EBL Works. In Proceedings of AAAI-90.
9. Etzioni. O. & Etzioni, R. (1994). Statistical Methods for Analyzing Speedup Learning Experiments. Machine Learning 14(3), 333-347.
10. Fisher, M. (1981). The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27(1) 1-18.
11. Frost, D. & Dechter, R. (1994). In Search of the Best Constraint Satisfaction Search. In Proceedings of AAAI-94.
12. Gaschnig, J. (1979). Performance Measurement and Analysis of Certain Search Algorithms. Technical Report CMU-CS-79-124, Carnegie-Mellon University.
13. Ginsberg, M. (1993). Dynamic Backtracking. Journal of Artificial Intelligence Research 1, 25-46.
14. Gratch, J. & DeJong, G. (1992). COMPOSER: A Probabilistic Solution to the Utility Problem in Speedup Learning. In Proceedings of AAAI-92.
15. Gratch, J., Chien, S., & DeJong, G. (1993). Learning Search Control Knowledge for Deep Space Network Scheduling. In Proceedings of the Ninth International Conference on Machine Learning.
16. Gratch, J. & DeJong, G. (1996). A Decision-theoretic Approach to Adaptive Problem Solving. Artificial Intelligence (to appear, Winter 1996).
17. Greiner, R. & Jurisica, I. (1992). A Statistical Approach to Solving the EBL Utility Problem. In Proceedings of AAAI-92.
18. Haralick, R. & Elliott, G. (1980). Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263-313.
19. Held, M. & Karp, R. (1970). The Traveling Salesman Problem and Minimum Spanning Trees. Operations Research 18, 1138-1162.
20. Holder, L. (1992). Empirical Analysis of the General Utility Problem in Machine Learning. In Proceedings of AAAI-92.
21. Kambhampati, S., Knoblock, C. & Yang, Q. (1995). Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial Order Planning. Artificial Intelligence: Special Issue on Planning and Scheduling 66, 167-238.
22. Kwak, N. & Schniederjans, M. (1987). Introduction to Mathematical Programming, New York: Robert E. Krieger Publishing.
23. Laird, J., Rosenbloom, P. & Newell, A. (1986). Universal Subgoaling and Chunking: The Automatic Generation and Learning of Goal Hierarchies. Norwell, MA: Kluwer Academic Publishers.
24. Laird, P. (1992). Dynamic Optimization. In Proceedings of the Ninth International Conference on Machine Learning.
25. Mackworth, A. (1992). Constraint Satisfaction. In Encyclopedia of Artificial Intelligence, Stuart C. Shapiro (ed.).
26. McAllester, D. & Rosenblitt, D. (1991). Systematic Nonlinear Planning. In Proceedings of AAAI-91.
27. Minton, S. (1988). Learning Search Control Knowledge: An Explanation-Based Approach, Norwell, MA: Kluwer Academic Publishers.
28. Minton, S. (1993). Integrating Heuristics for Constraint Satisfaction Problems: A Case Study. In Proceedings of AAAI-93.
29. Moore, A. & Lee, M. (1994). Efficient Algorithms for Minimizing Cross Validation Error. In Proceedings of the Tenth International Conference on Machine Learning.
30. Nelson, B. & Matejcik, F. (1995). Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisions in Simulation. Management Science.
31. Sacerdoti, E. (1977). A Structure for Plans and Behavior. New York: American Elsevier.
32. Sadeh, N. (1994). Micro-opportunistic Scheduling: The Micro-boss Factory Scheduler. In Intelligent Scheduling. San Mateo, CA: Morgan Kaufman.
33. Segre, A., Elkan, C., & Russell, A. (1991). A Critical Look at Experimental Evaluations of EBL. Machine Learning 6(2).
34. Smith, S. & Cheng, C. (1993). Slack-based Heuristics for Constraint-satisfaction Scheduling. In Proceedings of AAAI-93.
35. Smith, S. (1994). OPIS: A Methodology and Architecture for Reactive Scheduling. In Intelligent Scheduling. San Mateo, CA: Morgan Kaufman.
36. Smyth, P. & Mellstrom, J. (1992). Detecting Novel Classes with Applications to Fault Diagnosis. In Proceedings of the Ninth International Conference on Machine Learning.
37. Smyth, P. (1993). Probability Density Estimation and Local Basis Function Neural Networks. Computational Learning Theory and Natural Learning Systems 2.
38. Stallman, R. & Sussman, G. (1977). Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. Artificial Intelligence 9, 2, 135-196.
39. Stone, P., Veloso, M., & Blythe, J. (1994). The Need for Different Domain-Independent Heuristics. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems.
40. Subramanian, D. & Hunter, S. (1992). Measuring Utility and the Design of Provably Good EBL Algorithms. In Proceedings of the Ninth International Conference on Machine Learning.
41. Taha, H. (1982). Operations Research, an Introduction, Macmillan Publishing Co.
42. Wilkins, D. (1988). Practical Planning: Extending the Classical Artificial Intelligence Planning Paradigm. San Mateo, CA: Morgan Kaufman.
43. Xiong, Y., Sadeh, N., & Sycara, K. (1992). Intelligent Backtracking Techniques for Job Shop Scheduling. In Proceedings of the Third International Conference on Knowledge Representation and Reasoning.
44. Yakowitz, S. & Lugosi, E. (1990). Random Search in the Presence of Noise, with Application to Machine Learning. Society for Industrial and Applied Mathematics Journal of Scientific and Statistical Computing 11, 4, 702-712.
45. Yang, Q. & Murray, C. (1994). An Evaluation of the Temporal Coherence Heuristic for Partial-Order Planning. Computational Intelligence 10, 2.