Annals of Operations Research

, Volume 12, Issue 1, pp 169–198 | Cite as

A task and resource scheduling system for automated planning

  • David P. Miller


Planning is done at both the strategic and tactical levels. This paper classifies some previous planning techniques into these different levels, and details of some of their problems. A planning technique known as heuristic task scheduling is then presented along with a planner architecture that integrates task-scheduling with more traditional techniques to form a system that bridges the strategic/tactical division


Scheduling automated planning heuristic search temporal reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, 1974).Google Scholar
  2. [2]
    J. Allen, Maintaining knowledge about temporal intervals, Commun. ACM 26, 11(1983)832.Google Scholar
  3. [3]
    D. Chapman, Planning for conjunctive goals, Technical Report TR-802, M.I.T. AI Laboratory (1985).Google Scholar
  4. [4]
    T. Dean, Temporal imagery: An approach to reasoning about time for planning and problem solving, Technical Report CSD/RR 433, Department of Computer Science, Yale University (1985); Ph.D. thesis.Google Scholar
  5. [5]
    T. Dean, Temporal reasoning with metric constraints, in:Proc. CSCSI 84 (Canadian Society for Computational Studies of Intelligence, 1984) pp. 28–32.Google Scholar
  6. [6]
    R. Fikes and N.J. Nilsson, Strips: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2(1971)189.Google Scholar
  7. [7]
    R.J. Firby, T. Dean and D. Miller, Efficient robot planning with deadlines and travel time, in:Proc. 6th Int. Symp. on Robotics and Automation (IASTED, Santa Barbara, CA, 1985) pp. 97–101.Google Scholar
  8. [8]
    M.S. Fox, B. Allen and G. Strohm, Job-shop scheduling: an investigation in constraint-directed reasoning, in:Proc. National Conf. on Artificial Intelligence (AAAI, Pittsburgh, PN, 1982) pp. 155–158.Google Scholar
  9. [9]
    S. Hanks and D.V. McDermott, Default reasoning, nonmonotonic logics, and the frame problem, in:Proc. 5th National Conf. on Artificial Intelligence, Philadelphia, PN (1986) pp. 328–333.Google Scholar
  10. [10]
    F.S. Hiller and G.J. Lieberman,Operations Research (Holden-Day, 1974).Google Scholar
  11. [11]
    R.I. Levin and C.A. Kirkpatrick,Planning and Control with PERT/CPM (McGraw-Hill, 1966).Google Scholar
  12. [12]
    B. Lowerre, The HARPY speech recognition system, Ph.D. thesis, Carnegie-Mellon University (1976).Google Scholar
  13. [13]
    D.V. McDermott, The NISP manual, Technical Report 274, Department of Computer Science, Yale University (1983).Google Scholar
  14. [14]
    D.V. McDermott, A temporal logic for reasoning about processes and plans, Cognitive Science 6 (1982) 101.Google Scholar
  15. [15]
    D. Miller, R.J. Firby and T. Dean, Deadlines, travel time, and robot problem solving, in:Proc. 9th Int. Joint Conf. on Artificial Intelligence (IJCAI, AAAI, Los Angeles, CA, 1985) pp. 1052–1054.Google Scholar
  16. [16]
    D. Miller, AI planners for shop scheduling, in:Proc. 2nd Annual Artificial Intelligence and Advanced Computer Technology Conf. (1986) pp. 220–225.Google Scholar
  17. [17]
    D. Miller, Planning by search through simulations, Technical Report 423, Department of Computer Science, Yale University (1985); Ph.D. thesis.Google Scholar
  18. [18]
    D. Miller, Scheduling heuristics for problem solvers, Technical Report 264, Department of Computer Science, Yale University (1983).Google Scholar
  19. [19]
    E.D. Sacerdoti,A Structure for Plans and Behavior (Elsevier, New York, 1977).Google Scholar
  20. [20]
    E.D. Sacerdoti, Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974) 115.Google Scholar
  21. [21]
    A. Tate, Generating project networks, in:Proc. 5th Int. Joint Conf. on Artificial Intelligence (IJCAI, Cambridge, MA, 1977) pp. 888–893.Google Scholar
  22. [22]
    S.A. Vere, Temporal scope of assertions and window cutoff, JPL, AI Research Group Memo (1984).Google Scholar
  23. [23]
    S.A. Vere, Planning in time: windows and durations for activities and goals, IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-5 3(1983)246.Google Scholar
  24. [24]
    R. Wilenskey,Planning and Understanding (Addison-Wesley, 1983).Google Scholar

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1988

Authors and Affiliations

  • David P. Miller
    • 1
  1. 1.Department of Computer ScienceVirginia Polytechnic Institute and State UniversityBlacksburgUSA

Personalised recommendations