Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems
暂无分享,去创建一个
[1] François Laburthe,et al. Improved CLP Scheduling with Task Intervals , 1994, ICLP.
[2] Christian Artigues,et al. A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..
[3] Peter Brucker,et al. A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..
[4] Patrice Boizumault,et al. Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.
[5] Christian Bessiere,et al. Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.
[6] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..
[7] Rina Dechter,et al. Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.
[8] Armin Scholl,et al. Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..
[9] François Laburthe,et al. Cumulative Scheduling with Task Intervals , 1996, JICSLP.
[10] Gérard Ferrand,et al. Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.
[11] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..