Author:
Petit Thierry,Poder Emmanuel
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference29 articles.
1. Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57–73.
2. Baptiste, P., Pape, C. L., & Peridy, L. (1998). Global constraints for partial CSPs: A case-study of resource and due date constraints. In Proc. CP (pp. 87–102).
3. Baptiste, P., Le Pape, C., & Nuitjen, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305–333.
4. Beldiceanu, N., & Carlsson, M. (2002). A new multi-resource cumulatives constraint with negative heights. In Proc. CP (pp. 63–79).
5. Benoist, T., Jeanjean, A., Rochart, G., Cambazard, H., Grellier, E., & Jussien, N. (2006). Subcontractors scheduling on residential buildings construction sites. ISS’06 Int. Sched. Symposium, Technical Report JSME-06-203 (pp. 32–37).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Focus : A Constraint for Concentrating High Costs;Lecture Notes in Computer Science;2012
2. Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource;Principles and Practice of Constraint Programming – CP 2011;2011
3. The Objective Sum Constraint;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2011