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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.