A Mixed Closure-CSP Method to Solve Scheduling Problems

María Isabel Alfonso Galipienso, Federico Barber Sanchís. A Mixed Closure-CSP Method to Solve Scheduling Problems. In László Monostori, József Váncza, Moonis Ali, editors, Engineering of Intelligent Systems, 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2001, Budapest, Hungary, June 4-7, 2001, Proceedings. Volume 2070 of Lecture Notes in Computer Science, pages 559-570, Springer, 2001. [doi]

@inproceedings{GalipiensoS01,
  title = {A Mixed Closure-CSP Method to Solve Scheduling Problems},
  author = {María Isabel Alfonso Galipienso and Federico Barber Sanchís},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2070/20700559.htm},
  researchr = {https://researchr.org/publication/GalipiensoS01},
  cites = {0},
  citedby = {0},
  pages = {559-570},
  booktitle = {Engineering of Intelligent Systems},
  editor = {László Monostori and József Váncza and Moonis Ali},
  volume = {2070},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42219-6},
}