Kameng Nip, Zhenbo Wang, Wenxun Xing. Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. In Dachuan Xu, Donglei Du, Dingzhu Du, editors, Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Volume 9198 of Lecture Notes in Computer Science, pages 97-108, Springer, 2015. [doi]
@inproceedings{NipWX15,
title = {Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms},
author = {Kameng Nip and Zhenbo Wang and Wenxun Xing},
year = {2015},
doi = {10.1007/978-3-319-21398-9_8},
url = {http://dx.doi.org/10.1007/978-3-319-21398-9_8},
researchr = {https://researchr.org/publication/NipWX15},
cites = {0},
citedby = {0},
pages = {97-108},
booktitle = {Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings},
editor = {Dachuan Xu and Donglei Du and Dingzhu Du},
volume = {9198},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-21397-2},
}