A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility

Yazid Mati, Xiaolan Xie. A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility. In Proceedings of the 2003 IEEE International Conference on Robotics and Automation, ICRA 2003, September 14-19, 2003, Taipei, Taiwan. pages 157-162, IEEE, 2003.

@inproceedings{MatiX03,
  title = {A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility},
  author = {Yazid Mati and Xiaolan Xie},
  year = {2003},
  tags = {routing},
  researchr = {https://researchr.org/publication/MatiX03},
  cites = {0},
  citedby = {0},
  pages = {157-162},
  booktitle = {Proceedings of the 2003 IEEE International Conference on Robotics and Automation, ICRA 2003, September 14-19, 2003, Taipei, Taiwan},
  publisher = {IEEE},
}