Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
暂无分享,去创建一个
[1] Stephen F. Smith,et al. An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows , 1999, IJCAI.
[2] Pascal Van Hentenryck,et al. A constraint-based architecture for local search , 2002, OOPSLA '02.
[3] Pascal Van Hentenryck,et al. Maintaining Longest Paths Incrementally , 2003, Constraints.
[4] Stephen F. Smith,et al. Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems , 2000, AAAI/IAAI.
[5] Malik Ghallab,et al. Planning with Sharable Resource Constraints , 1995, IJCAI.
[6] Stephen F. Smith,et al. Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem , 1999, ECP.
[7] Stephen F. Smith,et al. Stochastic Procedures for Generating Feasible Schedules , 1997, AAAI/IAAI.
[8] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[9] Ehl Emile Aarts,et al. A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .
[10] Mary Beth Rosson,et al. Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications , 2000, Conference on Object-Oriented Programming Systems, Languages, and Applications.
[11] Pascal Van Hentenryck,et al. Control Abstractions for Local Search , 2003, Constraints.
[12] Wpm Wim Nuijten,et al. Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .