Author:
Baptiste Philippe,Le Pape Claude
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modelling 17:57–73.
2. D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149–156.
3. Ph. Baptiste and C. Le Pape [1995], A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling, Proc. 14th International Joint Conference on Artificial Intelligence.
4. P. Brucker, S. Knust, A. Schoo, and O. Thiele [1997], A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem, Working Paper, University of Osnabrück, 1997.
5. J. Carlier and B. Latapie [1991], Une méthode arborescente pour résoudre les problèmes cumulatifs, RAIRO Recherche opérationnelle / Operations Research 25(3):311–340.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献