CP Methods for Scheduling and Routing with Time-Dependent Task Costs

Elena Kelareva, Kevin Tierney, Philip Kilby. CP Methods for Scheduling and Routing with Time-Dependent Task Costs. In Carla P. Gomes, Meinolf Sellmann, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings. Volume 7874 of Lecture Notes in Computer Science, pages 111-127, Springer, 2013. [doi]

@inproceedings{KelarevaTK13,
  title = {CP Methods for Scheduling and Routing with Time-Dependent Task Costs},
  author = {Elena Kelareva and Kevin Tierney and Philip Kilby},
  year = {2013},
  doi = {10.1007/978-3-642-38171-3_8},
  url = {http://dx.doi.org/10.1007/978-3-642-38171-3_8},
  researchr = {https://researchr.org/publication/KelarevaTK13},
  cites = {0},
  citedby = {0},
  pages = {111-127},
  booktitle = {Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings},
  editor = {Carla P. Gomes and Meinolf Sellmann},
  volume = {7874},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-38171-3},
}