• Home
  • Search
  • Introduction to planning, scheduling and constraint satisfaction
  • Cite Icon37
  • https://doi.org/10.1007/s10845-008-0188-zCopy DOI Icon

Introduction to planning, scheduling and constraint satisfaction

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Planning, scheduling and constraint satisfaction are important areas in artificial intelligence (AI). Many real-world problems are known as AI planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. Therefore, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activities over time in the presence of complex state-dependent constraints. Constraint satisfaction plays also an important role to solve real-life problems, so that integrated techniques that manage planning and scheduling with constraint satisfaction remains necessary. This special issue on Planning, Scheduling and Constraint Satisfaction compiles a selection of papers of CAEPIA’2007 workshop on Planning, Scheduling and Constraint Satisfaction and COPLAS’2007: CP/ICAPS 2007 Joint Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. This issue presents novel advances on planning, scheduling, constraint programming/constraint satisfaction problems (CSPs) and many other common areas that exist among them. On the whole, this issue mainly focus on managing complex problems where planning, scheduling, constraint satisfaction and search must be combined and/or interrelated, which entails an enormous potential for practical applications and future research. Furthermore, this issue also includes a complete survey about constraint satisfaction, planning, scheduling and integration among these areas.

Similar Papers
  • Book Chapter
  • Citations39

A Logical Approach to Constraint Satisfaction

  • Jan 01, 2008
  • Phokion G Kolaitis +1
  • Research Article
  • Citations6

Two-stage differential evolution with dynamic population assignment for constrained multi-objective optimization

  • Jul 16, 2024
  • Swarm and Evolutionary Computation
  • Bin Xu +2
  • Research Article
  • Citations1

Connections between default reasoning and partial constraint satisfaction

  • Aug 01, 1999
  • Information Sciences
  • A.K Ghose +3
  • Book Chapter
  • Citations2

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 01, 2016
  • Ricardo Soto +4
  • Conference Article
  • Citations2

K-Server Optimal Task Scheduling Problem with Convex Cost Function

  • Apr 04, 2005
  • Mingjie Lin +1
  • Research Article
  • Citations3

Supporting Upper Elementary Students in Learning AI Concepts with Story-Driven Game-Based Learning

  • Mar 24, 2024
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Anisha Gupta +8
  • Conference Article
  • Citations11

A Case Study of Artificial Intelligence Planner for Make – to – Order Precast Concrete Production Planning

  • Jun 24, 2005
  • Vacharapoom Benjaoran +1
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Research Article
  • Citations3

A.I. as an Introduction to Research Methods in Computer Science

  • Mar 05, 2016
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Raghuram Ramanujan
  • Book Chapter
  • Citations7

Constraint Satisfaction with a Multi-Dimensional Domain

  • Jan 01, 1992
  • Artificial Intelligence Planning Systems
  • Masazumi Yoshikawa +1
  • Research Article
  • Citations32

An agent-based fuzzy constraint-directed negotiation model for solving supply chain planning and scheduling problems

  • Aug 01, 2016
  • Applied Soft Computing
  • Chia-Yu Hsu +4
  • Research Article
  • Citations51

Scheduling Aircraft Using Constraint Satisfaction

  • Nov 01, 2002
  • Electronic Notes in Theoretical Computer Science
  • Pim Van Leeuwen +2
  • Book Chapter
  • Citations26

Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints

  • Jan 01, 1994
  • A C Thornton
  • Conference Article
  • Citations3

Queue-Aware Priority Based Scheduling and Power Allocation in Full-Duplex OFDMA Cellular Networks

  • Jun 01, 2018
  • Hassan Fawaz +3
  • Research Article
  • Citations38

Data-driven feasibility analysis for the integration of planning and scheduling problems

  • Aug 05, 2019
  • Optimization and Engineering
  • Lisia S Dias +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.