Visopt shopfloor: On the edge of planning and scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 587-602

  Barták, Roman ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; ENGINES; LOGIC PROGRAMMING;

COMPLETE SYSTEM; COMPLEX INDUSTRIES; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT MODEL; PLANNING AND SCHEDULING; PLANNING CAPABILITY; SCHEDULING METHODS; SCHEDULING PROBLEM;

SCHEDULING;

EID: 84956976002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_39     Document Type: Conference Paper

References (20)

1. Baptiste, P. and Le Pape, C.: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996).
2. Barták, R.: Conceptual Models for Combined Planning and Scheduling. Electronic Notes in Discrete Mathematics, Volume 4, Elsevier (1999).
3. Barták, R.: Dynamic Constraint Models for Planning and Scheduling Problems. Proceedings of the ERCIM/CompulogNet Workshop on Constraint Programming, LNAI Series, Springer Verlag (2000).
4. Barták, R.: Filtering Algorithms for Tabular Constraints, in Proceedings of CP2001 Workshop CICLOPS, Paphos, Cyprus (2001), 168-182.
5. Barták, R.: Dynamic Global Constraints in Backtracking Based Environments, in Annals of Operations Research, Kluwer (2002), to appear.
6. Barták, R.: Modelling Transition Constraints. The ECAI Workshop on Modelling and Solving Problems with Constraints (2002).
7. Beck, J.Ch. and Fox, M.S.: Scheduling Alternative Activities. Proceedings of AAAI-99, USA (1999), 680-687.
8. Brusoni, V., Console, L., Lamma E, Mello P, Milano M, Terenziani P.: Resource-based vs. Task-based Approaches for Scheduling Problems. Proceedings of the 9th ISMIS96, LNCS Series, Springer Verlag (1996).
9. Gallaire, H.: Logic Programming: Further Developments, in: IEEE Symposium on Logic Programming, Boston, IEEE (1985).
10. Joslin, D. and Pollack M.E.: Passive and Active Decision Postponement in Plan Generation. Proceedings of the Third European Conference on Planning (1995).
11. Laborie P.: Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results. In Proceedings of 6th European Conference on Planning, Toledo, Spain (2001), 205-216.
12. Mittal, S. and Falkenhainer, B.: Dynamic Constraint Satisfaction Problems. Proceedings of AAAI-90, USA (1990), 25-32.
13. Nareyek, A.: Structural Constraint Satisfaction. Proceedings of AAAI-99 Workshop on Configuration (1999).
14. Nareyek, A.: AI Planning in a Constraint Programming Framework. Proceedings of the Third International Workshop on Communication-Based Systems (2000).
15. Pegman, M.: Short Term Liquid Metal Scheduling. Proceedings of PAPPACT98 Conference, London (1998), 91-99.
16. van Hentenryck, P.: Constraint Satisfaction in Logic Programming, The MIT Press, Cambridge, Mass. (1989).
17. Van Hentenryck, P., Deville, Y.: The Cardinality Operator: A new Logical Connective for Constraint Logic Programming. Proceedings of the International Conference on Logic Programming (1991), 745-759.
18. Wallace, M.: Applying Constraints for Scheduling, in: Constraint Programming, Mayoh B. and Penjaak J. (eds.), NATO ASI Series, Springer Verlag (1994).
19. Zhou, J.: A Permutation-Based Approach for Solving the Job-Shop Problem. Constraints, vol. 2 no. 2 (1997), 185-213.
20. Visopt B.V. http://www.visopt.com