Constraint-based scheduling
暂无分享,去创建一个
[1] Philippe Baptiste,et al. Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling , 1995 .
[2] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[3] Claude Le Pape,et al. Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .
[4] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[5] Pascal Van Hentenryck. The OPL optimization programming language , 1999 .
[6] Mark S. Fox,et al. Intelligent Scheduling , 1998 .
[7] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[8] Ehl Emile Aarts,et al. A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .
[9] Philippe Baptiste,et al. Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .
[10] Jacek Blazewicz,et al. Scheduling in Computer and Manufacturing Systems , 1990 .
[11] Irvin J. Lustig,et al. Constraint Programming and Its Relationship to Mathematical Programming , 2001 .
[12] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[13] Pascal Van Hentenryck. Scheduling and Packing in the Constraint Language cc(FD) , 1992 .
[14] Bernard A. Nadel,et al. Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .
[15] Lise Getoor,et al. Effective Redundant Constraints for Online Scheduling , 1997, AAAI/IAAI.
[16] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[17] Fahiem Bacchus,et al. Dynamic Variable Ordering in CSPs , 1995, CP.
[18] Tad Hogg,et al. Phase Transitions and the Search Problem , 1996, Artif. Intell..
[19] Toby Walsh. The Constrainedness Knife-Edge , 1998, AAAI/IAAI.
[20] Francesca Rossi,et al. Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions , 2000 .
[21] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.
[22] J. MarkusP.,et al. Optimal Incremental and Anytime Scheduling , 1995 .
[23] Eric Pinson,et al. A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .
[24] Marko Bacic,et al. Model predictive control , 2003 .
[25] Vipin Kumar,et al. Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..
[26] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[27] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[28] Rob Sherwood,et al. ASPEN-Automated Planning and Scheduling for Space Mission Operation , 2000 .
[29] Vijay A. Saraswat,et al. Model-Based Computing: Using Concurrent Constraint Programming for Modeling and Model Compilation , 1995, CP.
[30] Nicolas Beldiceanu,et al. Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.
[31] Daniel G. Bobrow,et al. Model-Based Computing: Developing Flexible Machine Control Software , 1999, Artif. Intell..
[32] Nicola Muscettola,et al. Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.
[33] Francesca Rossi,et al. Constraint Propagation for Soft Constraints: Generalization and Termination Conditions , 2000, CP.
[34] Philippe Baptiste,et al. Constraint-Based Optimization and Approximation for Job-Shop Scheduling , 1995 .