Author:
Kreter Stefan,Schutt Andreas,Stuckey Peter J.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference27 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. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network Flows. Englewood Cliffs: Prentice Hall.
3. Baptiste, P. (1994). Constraint-based scheduling: Two extensions. Master’s thesis, University of Strathclyde Glasgow. United Kingdom: Scotland.
4. Beldiceanu, N. (1998). Parallel machine scheduling with calendar rules. International Workshop on Project Management and Scheduling.
5. Cheng, J., Fowler, J., Kempf, K., & Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research, 53, 275–287.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献