Author:
Beldiceanu Nicolas,Carlsson Mats
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aggoun, A., Beldiceanu, N.: Extending CHIP to solve Complex Scheduling and Packing Problems. Mathl. Comput. Modelling, 17(7), pages 57–73, (1993).
2. Artigues, C, Roubellat, F.: A polynomial activity insertion algorithm in a multiresource schedule with cumulative constraints and multiple modes. In European Journal of Operational Research (EJOR), 127, pages 297–316, (2000).
3. Barták, R.: Dynamic Constraint Models for Planning and Scheduling Problems. In New Trends in Constraints (Papers from the Joint ERCIM/Compulog-Net Workshop, Cyprus, October 25–27, 1999), LNAI 1865, Springer Verlag, (2000).
4. Baptiste, P., Le Pape, C, Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, International Series in Operations Research & Management Science, (2001).
5. Beck, J. C, Fox, M. S.: Constraint-directed techniques for scheduling alternative activities. In Artificial Intelligence 121, pages 211–250, (2000).
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献