Combinations of some shop scheduling problems and the shortest path problem: Complexity and approximation algorithms.

Recommended citation: Nip K., Wang Z., Xing W. Combinations of some shop scheduling problems and the shortest path problem: Complexity and approximation algorithms. In: Xu, D. et al. (eds.) The 21th Annual International Computing and Combinatorics Conference (COCOON 2015), Lecture Notes in Computer Science, vol. 9198, pp. 97–108. Springer, Switzerland, 2015