A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem

Idir Hamaz, Laurent Houssin, Sonia Cafieri. A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem. In Jon Lee 0001, Giovanni Rinaldi, Ali Ridha Mahjoub, editors, Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers. Volume 10856 of Lecture Notes in Computer Science, pages 228-240, Springer, 2018. [doi]

@inproceedings{HamazHC18-0,
  title = {A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem},
  author = {Idir Hamaz and Laurent Houssin and Sonia Cafieri},
  year = {2018},
  doi = {10.1007/978-3-319-96151-4_20},
  url = {https://doi.org/10.1007/978-3-319-96151-4_20},
  researchr = {https://researchr.org/publication/HamazHC18-0},
  cites = {0},
  citedby = {0},
  pages = {228-240},
  booktitle = {Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
  editor = {Jon Lee 0001 and Giovanni Rinaldi and Ali Ridha Mahjoub},
  volume = {10856},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-96151-4},
}