ITAS: A Portable, Interactive Transportation Scheduling Tool Using a Search Engine Generated from Formal Specifications

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages 35-44

  Burstein, Mark H ^a   Smith, Douglas R ^b  

^a BBN TECHNOLOGIES   (United States)

^b KESTREL INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING ALGORITHMS; SEARCH ENGINES;

DEVELOPMENT SYSTEMS; INTERACTIVE DEVELOPMENT; JOINT PROGRAMS; LARGE PARTS; MIXED-INITIATIVE; PROGRAM SYNTHESIS; SCHEDULING SYSTEMS; SCHEDULING TOOLS; U.S. AIR FORCE; US AIR FORCE;

FORMAL SPECIFICATION;

EID: 0346970298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Applegate, D., and Cook, W. 1991. A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3(2):149-156..
2. Biefeld, E., and Cooper, L. 1990. Operations mission planner. Technical Report JPL 90-16, Jet Propulsion Laboratory.
3. Cai, J., and Paige, R. 1989. Program derivation by fixed point computation. Science of Computer Programming 11:197-261.
4. Fox, M. S., and Smith, S. F. 1984. ISIS - a knowledge-based system for factory scheduling. Expert Systems 1(1):25-49.
5. Fox, M. S.; Sadeh, N.; and Baykan, C. 1989. Constrained heuristic search. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 309-315.
6. Hentenryck, P. V. 1989. Constraint Satisfaction in Logic Programming. Cambridge, M A: Massachusetts Institute of Technology.
7. Luenberger, D. G. 1989. Linear and Nonlinear Programming. Reading, MA: Addison-Wesley Publishing Company, Inc.
8. Minton, S.; Johnson, M.; Philips, A. B.; and Laird, P. 1990. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the Eighth National Conference on Artificial Intelligence, 290-295.
9. Nemhauser, G. L., and Wolsey, L. A. 1988. Integer and Combinatorial Optimization. New York: John Wiley & Sons, Inc.
10. Sadeh, N. 1991. Look-ahead techniques for micro-opportunistic job shop scheduling. Technical Report CMU-CS-91-102, Carenegie-Mellon University.
11. elman, B.; Levesque, H.; and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, 440-446..
12. Smith, D. R. 1987. Structure and design of global search algorithms. Technical Report KES.U.87.12, Kestrel Institute.
13. Smith, D. R. September 1990. K I D S - a semiautomatic program development system. IEEE Transactions on Soßware Engineering Special Issue on Formal Methods in Software Engineering 16(9):1024-1043.
14. Smith, D. R. September 1990. KIDS - a semiautomatic program development system. IEEE Transactions on Software Engineering Special Issue on Formal Methods in Software Engineering 16(9):1024-1043.
15. Smith, D. R. 1991. KIDS: A knowledge-based software development system. In Lowry, M., and McCartney, R., eds., Automating Software Design. Menlo Park: MIT Press. 483-514.
16. Smith, D. R. 1992. Transformational approach to scheduling. Technical Report KES.U.92.2, Kestrel Institute.
17. Smith, D. R., and Westfold, S. J. 1995. Synthesis of constraint algorithms. In Saraswat, V., and Hentenryck, P. V., eds., Principles and Practice of Constraint Programming. Cambridge, MA: The MIT Press.
18. Smith, D. R.; Parra, E. A.; and Westfold, S. J. 1995. Synthesis of high-performance transportation schedulers. Technical Report KES.U.95.6, Kestrel Institute.
19. Smith, S. F.; Fox, M. S.; and Ow, P. S. 1986. Constructing and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems. AI Magazine 7(4):45-61.
20. Smith, S. F. 1989. The OPIS framework for modeling manufacturing systems. Technical Report CMU-RI-TR-89-30, The Robotics Institute, Carenegie-Mellon University.
21. Srinivas, Y. V., and Jüllig, R. 1994. Specware:tm formal support for composing software. Technical Report KES.U.94.5, Kestrel Institute. To appear in Proceedings of the Conference on Mathematics of Program Construction, Kloster Irsee, Germany, July 1995.
22. Zweben, M.; Deale, M.; and Gargan, R. 1990. Anytime rescheduling. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control, 215-219. San Diego, CA: DARPA.