Arnaud Malapert, Christelle Gueret, Hadrien Cambazard, Narendra Jussien, André Langevin and Louis-Martin Rousseau
Paper (2013)
An external link is available for this itemDepartment: | Department of Mathematics and Industrial Engineering |
---|---|
Research Center: | CIRRELT - Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation |
PolyPublie URL: | https://publications.polymtl.ca/13503/ |
Conference Title: | 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013) |
Conference Location: | Rome, Italy |
Conference Date(s): | 2013-06-10 - 2013-06-14 |
Journal Title: | Proceedings of the International Conference on Automated Planning and Scheduling (vol. 23) |
DOI: | 10.1609/icaps.v23i1.13575 |
Official URL: | https://doi.org/10.1609/icaps.v23i1.13575 |
Date Deposited: | 18 Apr 2023 15:09 |
Last Modified: | 25 Sep 2024 15:50 |
Cite in APA 7: | Malapert, A., Gueret, C., Cambazard, H., Jussien, N., Langevin, A., & Rousseau, L.-M. (2013, June). An optimal constraint programming approach to the open-shop problem [Paper]. 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), Rome, Italy. Published in Proceedings of the International Conference on Automated Planning and Scheduling, 23. https://doi.org/10.1609/icaps.v23i1.13575 |
---|---|
Statistics
Dimensions