Abstract
This paper studies a combinatorial optimization problem which is obtained by combining the two-machine flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs constitutes a feasible solution to the shortest path problem, and to execute the selected jobs on two-machine flow shop to minimize the makespan. We argue that this problem is NP-hard, and propose two approximation algorithms with constant factor guarantee. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Nip, K., & Wang, Z. (2013). Combination of two-machine flow shop scheduling and shortest path problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 680–687). https://doi.org/10.1007/978-3-642-38768-5_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
