Planning and Scheduling

[1]  Roman Bart´k,et al.  Workflow Optimization with FlowOpt: On Modelling, Optimizing, Visualizing, and Analysing Production Workflows , 2011, 2011 International Conference on Technologies and Applications of Artificial Intelligence.

[2]  Roman Barták,et al.  On Constraint Models for Parallel Planning: The Novel Transition Scheme , 2011, SCAI.

[3]  Yixin Chen,et al.  A Novel Transition Based Encoding Scheme for Planning as Satisfiability , 2010, AAAI.

[4]  Cédric Pralet,et al.  Forward Constraint-Based Algorithms for Anytime Planning , 2009, ICAPS.

[5]  Frederic Py,et al.  Adaptive Control for Autonomous Underwater Vehicles , 2008, AAAI.

[6]  Roman Barták,et al.  Reformulating Constraint Models for Classical Planning , 2008, FLAIRS Conference.

[7]  José Reinaldo Silva,et al.  itSIMPLE 2.0: An Integrated Tool for Designing Planning Domains , 2007, ICAPS.

[8]  Amedeo Cesta,et al.  Mexar2: AI Solves Mission Planner Problems , 2007, IEEE Intelligent Systems.

[9]  Gerhard Friedrich,et al.  Handling Alternative Activities in Resource-Constrained Project Scheduling Problems , 2007, IJCAI.

[10]  Yaxin Bi,et al.  Combining rough decisions for intelligent text mining using Dempster’s rule , 2006, Artificial Intelligence Review.

[11]  Roman Barták,et al.  Temporal Networks with Alternatives: Complexity and Model , 2007, FLAIRS.

[12]  Roman Barták,et al.  Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities , 2005, Constraints.

[13]  Wheeler Ruml,et al.  On-line Planning and Scheduling for High-speed Manufacturing , 2005, ICAPS.

[14]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[15]  T. L. McCluskey,et al.  An Integrated Graphical Tool to support Knowledge Engineering in AI Planning , 2001 .

[16]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[17]  Pierre Lopez,et al.  On Not-First/Not-Last conditions in disjunctive scheduling , 2000, Eur. J. Oper. Res..

[18]  J. Christopher Beck,et al.  Constraint-directed techniques for scheduling alternative activities , 2000, Artif. Intell..

[19]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[20]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[21]  P. Pandurang Nayak,et al.  Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..

[22]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[23]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[24]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

[25]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[26]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[27]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[28]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[29]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[30]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[31]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.