Integrated Modelling for Planning, Scheduling, and Timetabling Problems
暂无分享,去创建一个
[1] James A. Hendler,et al. UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning , 1994, AIPS.
[2] Hana Rudová. Soft Scheduling , 2001, ArXiv.
[3] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.
[4] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[5] Jeffrey H. Kingston. Modelling Timetabling Problems with STTL , 2000, PATAT.
[6] Peter van Beek,et al. CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.
[7] Roman Barták. On the Boundary of Planning and Scheduling: A Study , 1999 .
[8] Roman Barták. Dynamic Constraint Models for Planning and Scheduling Problems , 1999, New Trends in Constraints.
[9] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[10] Subbarao Kambhampati,et al. Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.
[11] Jana Koehler,et al. Planning under Resource Constraints , 1998, ECAI.
[12] Philippe Laborie,et al. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..
[13] Alexander Nareyek,et al. Structural Constraint Satisfaction , 1999 .
[14] Roman Barták,et al. Interactive Timetabling , 2001, ArXiv.
[15] Roman Barták. A Slot Representation of the Resource-Centric Models for Scheduling Problems , 2000 .
[16] Alexander Nareyek. AI Planning in a Constraint Programming Framework , 2000 .
[17] J. Christopher Beck,et al. Scheduling Alternative Activities , 1999, AAAI/IAAI.
[18] Subbarao Kambhampati,et al. Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.
[19] Anthony Wren,et al. Scheduling, Timetabling and Rostering - A Special Relationship? , 1995, PATAT.