Slack-Based Heuristics for Constraint Satisfaction Scheduling
暂无分享,去创建一个
[1] Steven Minton,et al. Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.
[2] Nicola Muscettola,et al. Scheduling by iterative partition of bottleneck conflicts , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.
[3] Ari P. J. Vepsalainen. Priority rules for job shops with weighted tardiness costs , 1987 .
[4] J. Erschler,et al. Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..
[5] Norman Sadeh,et al. Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .
[6] E. Bensana,et al. OPAL: A Knowledge-Based System for Industrial Job-Shop Scheduling , 1988 .
[7] Norman M. Sadeh,et al. Intelligent Backtracking Techniques for Job Shop Scheduling , 1992, KR.
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] David Y. Y. Yun,et al. A Planning/Scheduling Methodology for the Constrained Resource Problem , 1989, IJCAI.
[10] J. Erschler,et al. Characterizing the set of feasible sequences for n jobs to be carried out on a single machine , 1980 .
[11] Mark D. Johnston,et al. Spike: AI scheduling for NASA's Hubble Space Telescope , 1990, Sixth Conference on Artificial Intelligence for Applications.