Pruning Search Space by Dominance Rules in Best First Search for the Job Shop Scheduling Problem
暂无分享,去创建一个
[1] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[2] Richard E. Korf. An Improved Algorithm for Optimal Bin Packing , 2003, IJCAI.
[3] Erwin Pesch,et al. Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..
[4] Ramiro Varela,et al. Scheduling as Heuristic Search with State Space Reduction , 2002, IBERAMIA.
[5] María R. Sierra,et al. Optimal Scheduling with Heuristic Best First Search , 2005, AI*IA.
[6] J. Carlier,et al. Adjustment of heads and tails for the job-shop problem , 1994 .
[7] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[8] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[9] Richard E. Korf. Optimal Rectangle Packing: New Results , 2004, ICAPS.
[10] Ira Pohl,et al. The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.
[11] Amitava Bagchi,et al. The multiple resource constrained project scheduling problem: A breadth-first approach , 1999, Eur. J. Oper. Res..
[12] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[13] Norman M. Sadeh,et al. Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..