Skip to main content
SpringerLink
Log in
Book cover

Compulog Net/ERCIM Workshop on Constraints

WC 1999: New Trends in Constraints pp 237–255Cite as

Dynamic Constraint Models for Planning and Scheduling Problems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1865))

Abstract

Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and scheduling problems are solved independently using different methods. Recent development of Constraint Programming brings a new breeze to these areas. It allows using the same techniques for modelling planning and scheduling problems as well as exploiting successful methods developed in Artificial Intelligence and Operations Research. In the paper we analyse the problems behind planning and scheduling in complex process environments and we propose to enhance the traditional schedulers by planning capabilities to solve these problems. We argue for using dynamic models to capture such mixed planning and scheduling environment. Despite of studying the proposed framework using the complex process environment background we believe that the results are applicable in general to other (non-production) problem areas where mixed planning and scheduling capabilities are desirable.

Supported by the Grant Agency of the Czech Republic under the contract no. 201/99/D057.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint Based Optimisation and Approximation for Job-Shop Scheduling. Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, Montreal, Canada (1995)

    Google Scholar 

  2. Barták, R.: On-line Guide to Constraint Programming. Charles University, Prague, http://kti.mff.cuni.cz/~bartak/constraints/

  3. Barták, R.: VisOpt-the Solver behind the User Interaction. White Paper, InSol Ltd., Israel (1999), available at URL http://www.visopt.com/

    Google Scholar 

  4. Barták, R.: Conceptual Models for Combined Planning and Scheduling. Proceedings of the CP99 Post-conference Workshop on Large Scale Combinatorial Optimisation and Constraints, Alexandria, USA (1999) 2–14

    Google Scholar 

  5. Barták, R.: On the Boundary of Planning and Scheduling: a Study. Proceedings of the Eighteenth Workshop of the UK Planning and Scheduling Special Interest Group, Manchester, UK (1999) 28–39

    Google Scholar 

  6. Blum, A. L. and Furst, M. L.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90 (1997) 281–300

    Article  MATH  Google Scholar 

  7. Brusoni, V., Console, L., Lamma. E., Mello, P., Milano, M., Terenziani, P.: Resourcebased vs. Task-based Approaches for Scheduling Problems. Proceedings of the 9th ISMIS96, LNCS Series, Springer Verlag (1996)

    Google Scholar 

  8. Caseau, Y., Laburthe, F.: Improved CLP Scheduling with Task Intervals. Proceedings of ICLP94, MIT Press, (1994) 369–383

    Google Scholar 

  9. Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task Intervals. Proceedings of JICSLP96, MIT Press (1996) 363–337

    Google Scholar 

  10. Caseau, Y., Laburthe, F.: A Constraint based approach to the RCPSP. Proceedings of the CP97 Workshop on Industrial Constraint-Directed Scheduling, Schloss Hagenberg, Austria (1997)

    Google Scholar 

  11. Crawford, J.M.: An Approach to Resource Constrained Project Scheduling. Artificial Intelligence and Manufacturing Research Planning Workshop (1996)

    Google Scholar 

  12. Joslin, D. and Pollack, M.E.: Passive and Active Decision Postponement in Plan Generation. Proceedings of the Third European Conference on planning (1995)

    Google Scholar 

  13. Fikes, R. E. and Nilsson, N. J.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 3–4 (1971) 189–208

    Article  Google Scholar 

  14. Nareyek, A.: AI Planning in a Constraint Programming Framework. Proceedings of the Third International Workshop on Communication-Based Systems (2000), to appear

    Google Scholar 

  15. Pegman, M.: Short Term Liquid Metal Scheduling. Proceedings of PAPPACT98 Conference, London (1998) 91–99

    Google Scholar 

  16. Pool, D., Mackworth, A., Goebel, R.: Computational Intelligence-A Logical Approach, Oxford University Press, Oxford (1998)

    Google Scholar 

  17. Srivastava, B. and Kambhampati, S.: Scaling up Planning by teasing out Resource Scheduling. Technical Report ASU CSE TR 99–005, Arizona State University (1999)

    Google Scholar 

  18. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1995)

    Google Scholar 

  19. Wallace, M.: Applying Constraints for Scheduling. Constraint Programming, Mayoh B. and Penjaak J. (Eds.), NATO ASI Series, Springer Verlag (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Department of Theoretical Computer Science, Charles University, Malostranske namesti 2/25, 118 00, Praha, Czech Republic

    Roman Barták

Authors
  1. Roman Barták
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CWI, Kruislaan 413, 1090, GB Amsterdam, The Netherlands

    Krzysztof R. Apt  & Eric Monfroy  & 

  2. Department of Computer Science, University of Cyprus, 75 Kallipoleos Str., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  3. Department of Pure and Applied Mathematics, University of Padua, Via G. B. Belzoni 7, 35131, Padua, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barták, R. (2000). Dynamic Constraint Models for Planning and Scheduling Problems. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds) New Trends in Constraints. WC 1999. Lecture Notes in Computer Science(), vol 1865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44654-0_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44654-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67885-4

  • Online ISBN: 978-3-540-44654-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation